J u m p t o c o n t e n t
M a i n m e n u
M a i n m e n u
N a v i g a t i o n
● M a i n p a g e
● C o n t e n t s
● C u r r e n t e v e n t s
● R a n d o m a r t i c l e
● A b o u t W i k i p e d i a
● C o n t a c t u s
● D o n a t e
C o n t r i b u t e
● H e l p
● L e a r n t o e d i t
● C o m m u n i t y p o r t a l
● R e c e n t c h a n g e s
● U p l o a d f i l e
S e a r c h
Search
A p p e a r a n c e
● C r e a t e a c c o u n t
● L o g i n
P e r s o n a l t o o l s
● C r e a t e a c c o u n t
● L o g i n
P a g e s f o r l o g g e d o u t e d i t o r s l e a r n m o r e
● C o n t r i b u t i o n s
● T a l k
( T o p )
1
M a t h e m a t i c a l p r o p e r t i e s
2
I n t e g e r s f r o m 3 0 1 t o 3 9 9
T o g g l e I n t e g e r s f r o m 3 0 1 t o 3 9 9 s u b s e c t i o n
2 . 1
3 0 0 s
2 . 1 . 1
3 0 1
2 . 1 . 2
3 0 2
2 . 1 . 3
3 0 3
2 . 1 . 4
3 0 4
2 . 1 . 5
3 0 5
2 . 1 . 6
3 0 6
2 . 1 . 7
3 0 7
2 . 1 . 8
3 0 8
2 . 1 . 9
3 0 9
2 . 2
3 1 0 s
2 . 2 . 1
3 1 0
2 . 2 . 2
3 1 1
2 . 2 . 3
3 1 2
2 . 2 . 4
3 1 3
2 . 2 . 5
3 1 4
2 . 2 . 6
3 1 5
2 . 2 . 7
3 1 6
2 . 2 . 8
3 1 7
2 . 2 . 9
3 1 8
2 . 2 . 1 0
3 1 9
2 . 3
3 2 0 s
2 . 3 . 1
3 2 0
2 . 3 . 2
3 2 1
2 . 3 . 3
3 2 2
2 . 3 . 4
3 2 3
2 . 3 . 5
3 2 4
2 . 3 . 6
3 2 5
2 . 3 . 7
3 2 6
2 . 3 . 8
3 2 7
2 . 3 . 9
3 2 8
2 . 3 . 1 0
3 2 9
2 . 4
3 3 0 s
2 . 4 . 1
3 3 0
2 . 4 . 2
3 3 1
2 . 4 . 3
3 3 2
2 . 4 . 4
3 3 3
2 . 4 . 5
3 3 4
2 . 4 . 6
3 3 5
2 . 4 . 7
3 3 6
2 . 4 . 8
3 3 7
2 . 4 . 9
3 3 8
2 . 4 . 1 0
3 3 9
2 . 5
3 4 0 s
2 . 5 . 1
3 4 0
2 . 5 . 2
3 4 1
2 . 5 . 3
3 4 2
2 . 5 . 4
3 4 3
2 . 5 . 5
3 4 4
2 . 5 . 6
3 4 5
2 . 5 . 7
3 4 6
2 . 5 . 8
3 4 7
2 . 5 . 9
3 4 8
2 . 5 . 1 0
3 4 9
2 . 6
3 5 0 s
2 . 6 . 1
3 5 0
2 . 6 . 2
3 5 1
2 . 6 . 3
3 5 2
2 . 6 . 4
3 5 3
2 . 6 . 5
3 5 4
2 . 6 . 6
3 5 5
2 . 6 . 7
3 5 6
2 . 6 . 8
3 5 7
2 . 6 . 9
3 5 8
2 . 6 . 1 0
3 5 9
2 . 7
3 6 0 s
2 . 7 . 1
3 6 0
2 . 7 . 2
3 6 1
2 . 7 . 3
3 6 2
2 . 7 . 4
3 6 3
2 . 7 . 5
3 6 4
2 . 7 . 6
3 6 5
2 . 7 . 7
3 6 6
2 . 7 . 8
3 6 7
2 . 7 . 9
3 6 8
2 . 7 . 1 0
3 6 9
2 . 8
3 7 0 s
2 . 8 . 1
3 7 0
2 . 8 . 2
3 7 1
2 . 8 . 3
3 7 2
2 . 8 . 4
3 7 3
2 . 8 . 5
3 7 4
2 . 8 . 6
3 7 5
2 . 8 . 7
3 7 6
2 . 8 . 8
3 7 7
2 . 8 . 9
3 7 8
2 . 8 . 1 0
3 7 9
2 . 9
3 8 0 s
2 . 9 . 1
3 8 0
2 . 9 . 2
3 8 1
2 . 9 . 3
3 8 2
2 . 9 . 4
3 8 3
2 . 9 . 5
3 8 4
2 . 9 . 6
3 8 5
2 . 9 . 7
3 8 6
2 . 9 . 8
3 8 7
2 . 9 . 9
3 8 8
2 . 9 . 1 0
3 8 9
2 . 1 0
3 9 0 s
2 . 1 0 . 1
3 9 0
2 . 1 0 . 2
3 9 1
2 . 1 0 . 3
3 9 2
2 . 1 0 . 4
3 9 3
2 . 1 0 . 5
3 9 4
2 . 1 0 . 6
3 9 5
2 . 1 0 . 7
3 9 6
2 . 1 0 . 8
3 9 7
2 . 1 0 . 9
3 9 8
2 . 1 0 . 1 0
3 9 9
3
R e f e r e n c e s
T o g g l e t h e t a b l e o f c o n t e n t s
3 0 0 ( n u m b e r )
5 5 l a n g u a g e s
● А ԥ с ш ә а
● ا ل ع ر ب ي ة
● Ա ր ե ւ մ տ ա հ ա յ ե ր է ն
● A z ə r b a y c a n c a
● 閩 南 語 / B â n - l â m - g ú
● C a t a l à
● Č e š t i n a
● E m i l i à n e r u m a g n ò l
● Э р з я н ь
● E s p a ñ o l
● E s p e r a n t o
● E u s k a r a
● ف ا ر س ی
● F u l f u l d e
● G a e i l g e
● 한 국 어
● Հ ա յ ե ր ե ն
● B a h a s a I n d o n e s i a
● I ñ u p i a t u n
● I t a l i a n o
● ע ב ר י ת
● K i s w a h i l i
● K r e y ò l a y i s y e n
● L u g a n d a
● M a g y a r
● М а к е д о н с к и
● म र ा ठ ी
● م ا ز ِ ر و ن ی
● B a h a s a M e l a y u
● ꯃ ꯤ ꯇ ꯩ ꯂ ꯣ ꯟ
● 閩 東 語 / M ì n g - d ĕ ̤ n g - n g ṳ ̄
● N e d e r l a n d s
● 日 本 語
● N o r s k b o k m å l
● O ʻ z b e k c h a / ў з б е к ч а
● پ ښ ت و
● P o l s k i
● P o r t u g u ê s
● R o m â n ă
● S e s o t h o s a L e b o a
● S i m p l e E n g l i s h
● S l o v e n š č i n a
● S o o m a a l i g a
● ک و ر د ی
● S v e n s k a
● T a g a l o g
● Т а т а р ч а / t a t a r ç a
● ไ ท ย
● У к р а ї н с ь к а
● ا ر د و
● T i ế n g V i ệ t
● W e s t - V l a m s
● י י ִ ד י ש
● 粵 語
● 中 文
E d i t l i n k s
● A r t i c l e
● T a l k
E n g l i s h
● R e a d
● E d i t
● V i e w h i s t o r y
T o o l s
T o o l s
A c t i o n s
● R e a d
● E d i t
● V i e w h i s t o r y
G e n e r a l
● W h a t l i n k s h e r e
● R e l a t e d c h a n g e s
● U p l o a d f i l e
● S p e c i a l p a g e s
● P e r m a n e n t l i n k
● P a g e i n f o r m a t i o n
● C i t e t h i s p a g e
● G e t s h o r t e n e d U R L
● D o w n l o a d Q R c o d e
● W i k i d a t a i t e m
P r i n t / e x p o r t
● D o w n l o a d a s P D F
● P r i n t a b l e v e r s i o n
I n o t h e r p r o j e c t s
● W i k i m e d i a C o m m o n s
A p p e a r a n c e
F r o m W i k i p e d i a , t h e f r e e e n c y c l o p e d i a
( R e d i r e c t e d f r o m 3 4 7 ( n u m b e r ) )
300 (three hundred ) is the natural number following 299 and preceding 301 .
Mathematical properties [ edit ]
The number 300 is the 24th triangular number , with factorization 2 2 × 3 × 52 .
It is the sum of a pair of twin primes , as well as a sum of ten consecutive primes:
300
=
13
+
17
+
19
+
23
+
29
+
31
+
37
+
41
+
43
+
47.
300
=
149
+
151.
{\displaystyle {\begin{aligned}300&=13+17+19+23+29+31+37+41+43+47.\\300&=149+151.\\\end{aligned}}}
Also, 30064 + 1 is prime .
300 is palindromic in three consecutive bases: 30010 = 6067 = 4548 = 3639 , and also in base 13.
300 is the eighth term in the Engel expansion of pi ,[1] following 19 and preceding 1991 .
Integers from 301 to 399 [ edit ]
309 = 3 × 103, Blum integer , number of primes <= 211 .[2]
312 = 23 × 3 × 13, idoneal number .[3]
314 = 2 × 157. 314 is a nontotient ,[4] smallest composite number in Somos-4 sequence.[5]
315 = 32 × 5 × 7 =
D
7
,
3
{\displaystyle D_{7,3}\!}
rencontres number , highly composite odd number, having 12 divisors.[6]
316 = 22 × 79, a centered triangular number [7] and a centered heptagonal number .[8]
317 is a prime number, Eisenstein prime with no imaginary part, Chen prime,[9] one of the rare primes to be both right and left-truncatable,[10] and a strictly non-palindromic number.
317 is the exponent (and number of ones) in the fourth base-10 repunit prime .[11]
319 = 11 × 29. 319 is the sum of three consecutive primes (103 + 107 + 109), Smith number ,[12] cannot be represented as the sum of fewer than 19 fourth powers, happy number in base 10[13]
320 = 26 × 5 = (2 5 ) × (2 ×5 ). 320 is a Leyland number ,[14] and maximum determinant of a 10 by 10 matrix of zeros and ones.
321 = 3 × 107, a Delannoy number [15]
322 = 2 × 7 × 23. 322 is a sphenic ,[16] nontotient, untouchable ,[17] and a Lucas number .[18]
323 = 17 × 19. 323 is the sum of nine consecutive primes (19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53), the sum of the 13 consecutive primes (5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47), Motzkin number .[19] A Lucas and Fibonacci pseudoprime . See 323 (disambiguation)
324 = 22 ×3 4 = 182 . 324 is the sum of four consecutive primes (73 + 79 + 83 + 89), totient sum of the first 32 integers, a square number,[20] and an untouchable number.[17]
325 = 52 × 13. 325 is a triangular number, hexagonal number ,[21] nonagonal number ,[22] centered nonagonal number .[23] 325 is the smallest number to be the sum of two squares in 3 different ways: 12 + 182 , 62 + 172 and 102 + 152 . 325 is also the smallest (and only known) 3-hyperperfect number .[24] [25]
326 = 2 × 163. 326 is a nontotient, noncototient,[26] and an untouchable number.[17] 326 is the sum of the 14 consecutive primes (3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47), lazy caterer number[27]
327 = 3 × 109. 327 is a perfect totient number ,[28] number of compositions of 10 whose run-lengths are either weakly increasing or weakly decreasing[29]
328 = 23 × 41. 328 is a refactorable number ,[30] and it is the sum of the first fifteen primes (2 + 3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47).
329 = 7 × 47. 329 is the sum of three consecutive primes (107 + 109 + 113), and a highly cototient number .[31]
330 = 2 × 3 × 5 × 11. 330 is sum of six consecutive primes (43 + 47 + 53 + 59 + 61 + 67), pentatope number (and hence a binomial coefficient
(
11
4
)
{\displaystyle {\tbinom {11}{4}}}
), a pentagonal number ,[32] divisible by the number of primes below it, and a sparsely totient number .[33]
331 is a prime number, super-prime, cuban prime ,[34] a lucky prime ,[35] sum of five consecutive primes (59 + 61 + 67 + 71 + 73), centered pentagonal number ,[36] centered hexagonal number ,[37] and Mertens function returns 0.[38]
332 = 22 × 83, Mertens function returns 0.[38]
333 = 32 × 37, Mertens function returns 0;[38] repdigit ; 2333 is the smallest power of two greater than a googol .
334 = 2 × 167, nontotient.[39]
335 = 5 × 67. 335 is divisible by the number of primes below it, number of Lyndon words of length 12.
336 = 24 × 3 × 7, untouchable number,[17] number of partitions of 41 into prime parts.[40]
337, prime number , emirp , permutable prime with 373 and 733, Chen prime,[9] star number
338 = 2 ×13 2 , nontotient, number of square (0,1)-matrices without zero rows and with exactly 4 entries equal to 1.[41]
339 = 3 × 113, Ulam number [42]
340 = 22 × 5 × 17, sum of eight consecutive primes (29 + 31 + 37 + 41 + 43 + 47 + 53 + 59), sum of ten consecutive primes (17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53), sum of the first four powers of 4 (4 1 + 42 + 43 + 44 ), divisible by the number of primes below it, nontotient, noncototient.[26] Number of regions formed by drawing the line segments connecting any two of the 12 perimeter points of a 3 times 3 grid of squares (sequence A331452 in the OEIS ) and (sequence A255011 in the OEIS ).
341 = 11 × 31, sum of seven consecutive primes (37 + 41 + 43 + 47 + 53 + 59 + 61), octagonal number ,[43] centered cube number ,[44] super-Poulet number .
341 is the smallest Fermat pseudoprime ; it is the least composite odd modulus m greater than the base b , that satisfies the Fermat property "b m −1 − 1 is divisible by m ", for bases up to 128 of b = 2, 15, 60, 63, 78, and 108.
342 = 2 ×3 2 × 19, pronic number,[45] Untouchable number.[17]
343 = 73 , the first nice Friedman number that is composite since 343 = (3 + 4)3 . It is the only known example of x2 +x+1 = y3 , in this case, x=18, y=7. It is z3 in a triplet (x,y,z) such that x5 + y2 = z3 .
344 = 23 × 43, octahedral number ,[46] noncototient,[26] totient sum of the first 33 integers, refactorable number.[30]
345 = 3 × 5 × 23, sphenic number,[16] idoneal number
346 = 2 × 173, Smith number,[12] noncototient.[26]
347 is a prime number, emirp , safe prime ,[47] Eisenstein prime with no imaginary part, Chen prime ,[9] Friedman prime since 347 = 73 + 4, twin prime with 349, and a strictly non-palindromic number.
348 = 22 × 3 × 29, sum of four consecutive primes (79 + 83 + 89 + 97), refactorable number .[30]
349, prime number, twin prime, lucky prime, sum of three consecutive primes (109 + 113 + 127), 5349 - 4349 , [48] is a prime number.
350 = 2 ×5 2 × 7 =
{
7
4
}
{\displaystyle \left\{{7 \atop 4}\right\}}
, primitive semiperfect number,[49] divisible by the number of primes below it, nontotient, a truncated icosahedron of frequency 6 has 350 hexagonal faces and 12 pentagonal faces.
351 = 33 × 13, triangular number, sum of five consecutive primes (61 + 67 + 71 + 73 + 79), member of Padovan sequence [50] and number of compositions of 15 into distinct parts.[51]
352 = 25 × 11, the number of n-Queens Problem solutions for n = 9. It is the sum of two consecutive primes (173 + 179), lazy caterer number[27]
354 = 2 × 3 × 59 = 14 + 24 + 34 + 44 ,[52] [53] sphenic number,[16] nontotient, also SMTP code meaning start of mail input. It is also sum of absolute value of the coefficients of Conway's polynomial .
355 = 5 × 71, Smith number,[12] Mertens function returns 0,[38] divisible by the number of primes below it.
The numerator of the best simplified rational approximation of pi having a denominator of four digits or fewer. This fraction (355/113) is known as Milü and provides an extremely accurate approximation for pi.
356 = 22 × 89, Mertens function returns 0.[38]
357 = 3 × 7 × 17, sphenic number .[16]
358 = 2 × 179, sum of six consecutive primes (47 + 53 + 59 + 61 + 67 + 71), Mertens function returns 0,[38] number of ways to partition {1,2,3,4,5} and then partition each cell (block) into subcells.[54]
361 = 192 . 361 is a centered triangular number,[7] centered octagonal number , centered decagonal number ,[55] member of the Mian–Chowla sequence ;[56] also the number of positions on a standard 19 x 19 Go board.
362 = 2 × 181 = σ2 (19 ): sum of squares of divisors of 19,[57] Mertens function returns 0,[38] nontotient, noncototient.[26]
364 = 22 × 7 × 13, tetrahedral number ,[58] sum of twelve consecutive primes (11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53), Mertens function returns 0,[38] nontotient .
It is a repdigit in base 3 (111111), base 9 (444), base 25 (EE ), base 27 (DD ), base 51 (77 ) and base 90 (44 ), the sum of six consecutive powers of 3 (1 + 3 + 9 + 27 + 81 + 243), and because it is the twelfth non-zero tetrahedral number .[58]
366 = 2 × 3 × 61, sphenic number ,[16] Mertens function returns 0,[38] noncototient,[26] number of complete partitions of 20,[59] 26-gonal and 123-gonal. Also the number of days in a leap year .
367 is a prime number, a lucky prime,[35] Perrin number ,[60] happy number , prime index prime and a strictly non-palindromic number.
368 = 24 × 23. It is also a Leyland number .[14]
370 = 2 × 5 × 37, sphenic number,[16] sum of four consecutive primes (83 + 89 + 97 + 101), nontotient, with 369 part of a Ruth–Aaron pair with only distinct prime factors counted, Base 10 Armstrong number since 33 + 73 + 03 = 370.
371 = 7 × 53, sum of three consecutive primes (113 + 127 + 131), sum of seven consecutive primes (41 + 43 + 47 + 53 + 59 + 61 + 67), sum of the primes from its least to its greatest prime factor,[61] the next such composite number is 2935561623745, Armstrong number since 33 + 73 + 13 = 371.
372 = 22 × 3 × 31, sum of eight consecutive primes (31 + 37 + 41 + 43 + 47 + 53 + 59 + 61), noncototient ,[26] untouchable number ,[17] --> refactorable number.[30]
373, prime number, balanced prime ,[62] one of the rare primes to be both right and left-truncatable (two-sided prime ),[10] sum of five consecutive primes (67 + 71 + 73 + 79 + 83), sexy prime with 367 and 379, permutable prime with 337 and 733, palindromic prime in 3 consecutive bases: 5658 = 4549 = 37310 and also in base 4: 113114 .
374 = 2 × 11 × 17, sphenic number ,[16] nontotient, 3744 + 1 is prime.[63]
375 = 3 ×5 3 , number of regions in regular 11-gon with all diagonals drawn.[64]
376 = 23 × 47, pentagonal number ,[32] 1-automorphic number ,[65] nontotient, refactorable number.[30] There is a math puzzle in which when 376 is squared, 376 is also the last three digits, as 376 * 376 = 141376 [66]
377 = 13 × 29, Fibonacci number , a centered octahedral number ,[67] a Lucas and Fibonacci pseudoprime , the sum of the squares of the first six primes.
378 = 2 ×3 3 × 7, triangular number, cake number , hexagonal number,[21] Smith number.[12]
379 is a prime number, Chen prime,[9] lazy caterer number[27] and a happy number in base 10. It is the sum of the 15 consecutive primes (3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53). 379! - 1 is prime.
380 = 22 × 5 × 19, pronic number,[45] number of regions into which a figure made up of a row of 6 adjacent congruent rectangles is divided upon drawing diagonals of all possible rectangles.[68]
381 = 3 × 127, palindromic in base 2 and base 8.
381 is the sum of the first 16 prime numbers (2 + 3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53).
382 = 2 × 191, sum of ten consecutive primes (19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53 + 59), Smith number.[12]
383, prime number, safe prime,[47] Woodall prime ,[69] Thabit number , Eisenstein prime with no imaginary part, palindromic prime. It is also the first number where the sum of a prime and the reversal of the prime is also a prime.[70] 4 383 - 3383 is prime .
385 = 5 × 7 × 11, sphenic number ,[16] square pyramidal number ,[71] the number of integer partitions of 18.
385 = 102 + 92 + 82 + 72 + 62 + 52 + 42 + 32 + 22 + 12
386 = 2 × 193, nontotient, noncototient,[26] centered heptagonal number,[8] number of surface points on a cube with edge-length 9.[72]
387 = 32 × 43, number of graphical partitions of 22.[73]
388 = 22 × 97 = solution to postage stamp problem with 6 stamps and 6 denominations,[74] number of uniform rooted trees with 10 nodes.[75]
389, prime number, emirp , Eisenstein prime with no imaginary part, Chen prime,[9] highly cototient number,[31] strictly non-palindromic number. Smallest conductor of a rank 2 Elliptic curve .
390 = 2 × 3 × 5 × 13, sum of four consecutive primes (89 + 97 + 101 + 103), nontotient,
∑
n
=
0
10
390
n
{\displaystyle \sum _{n=0}^{10}{390}^{n}}
is prime[76]
391 = 17 × 23, Smith number,[12] centered pentagonal number .[36]
392 = 23 ×7 2 , Achilles number .
393 = 3 × 131, Blum integer , Mertens function returns 0.[38]
394 = 2 × 197 = S5 a Schröder number ,[77] nontotient, noncototient.[26]
395 = 5 × 79, sum of three consecutive primes (127 + 131 + 137), sum of five consecutive primes (71 + 73 + 79 + 83 + 89), number of (unordered, unlabeled) rooted trimmed trees with 11 nodes.[78]
396 = 22 ×3 2 × 11, sum of twin primes (197 + 199), totient sum of the first 36 integers, refactorable number,[30] Harshad number, digit-reassembly number .
397, prime number, cuban prime,[34] centered hexagonal number.[37]
398 = 2 × 199, nontotient.
∑
n
=
0
10
398
n
{\displaystyle \sum _{n=0}^{10}{398}^{n}}
is prime[76]
399 = 3 × 7 × 19, sphenic number,[16] smallest Lucas–Carmichael number , Leyland number of the second kind . 399! + 1 is prime.
References [ edit ]
^ Sloane, N. J. A. (ed.). "Sequence A000926 (Euler's "numerus idoneus" (or "numeri idonei", or idoneal, or suitable, or convenient numbers))" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A005277 (Nontotients: even numbers k such that phi(m )=k has no solution)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A006720 (Somos-4 sequence)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A053624 (Highly composite odd numbers (1 ): where d(n ) increases to a record)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A069099 (Centered heptagonal numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b c d e Sloane, N. J. A. (ed.). "Sequence A109611 (Chen primes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A020994 (Primes that are both left-truncatable and right-truncatable)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Guy, Richard; Unsolved Problems in Number Theory , p. 7 ISBN 1475717385
^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A006753 (Smith numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A007770 (Happy numbers: numbers whose trajectory under iteration of sum of squares of digits map (see A003132) includes 1)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A076980 (Leyland numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A001850 (Central Delannoy numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b c d e f g h i Sloane, N. J. A. (ed.). "Sequence A007304 (Sphenic numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A005114 (Untouchable numbers, also called nonaliquot numbers: impossible values for the sum of aliquot parts function)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000032 (Lucas numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000290 (The squares: a(n ) = n^2)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A000384 (Hexagonal numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A001106 (9-gonal numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A060544 (Centered 9-gonal numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A034897 (Hyperperfect numbers: x such that x = 1 + k*(sigma(x )-x-1) for some k > 0)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A007594 (Smallest n-hyperperfect number: m such that m=n(sigma(m )-m-1)+1; or 0 if no such number exists)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b c d e f g h i Sloane, N. J. A. (ed.). "Sequence A005278 (Noncototients)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b c Sloane, N. J. A. (ed.). "Sequence A000124 (Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A082897 (Perfect totient numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A332835 (Number of compositions of n whose run-lengths are either weakly increasing or weakly decreasing)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A033950 (Refactorable numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A100827 (Highly cototient numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A000326 (Pentagonal numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A036913 (Sparsely totient numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A002407 (Cuban primes: primes which are the difference of two consecutive cubes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A031157 (Numbers that are both lucky and prime)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A005891 (Centered pentagonal numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A003215 (Hex numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b c d e f g h i j Sloane, N. J. A. (ed.). "Sequence A028442 (Numbers n such that Mertens' function is zero)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A003052 (Self numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000607 (Number of partitions of n into prime parts)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A122400 (Number of square (0,1)-matrices without zero rows and with exactly n entries equal to 1)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A002858 (Ulam numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000567 (Octagonal numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A005898 (Centered cube numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b {{cite OEIS|A002378|2=Oblong (or promic, pronic, or heteromecic) numbers: a(n ) = n*(n+1)
^ Sloane, N. J. A. (ed.). "Sequence A005900 (Octahedral numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A005385 (Safe primes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A059802 (Numbers k such that 5^k - 4^k is prime)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A006036 (Primitive pseudoperfect numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000931 (Padovan sequence)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A032020 (Number of compositions (ordered partitions) of n into distinct parts)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000538 (Sum of fourth powers: 0^4 + 1^4 + ... + n^4)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A031971 (a(n ) = Sum_{k=1..n} k^n)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000258 (Expansion of e.g.f. exp(exp(exp(x )-1)-1))" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A062786 (Centered 10-gonal numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A005282 (Mian-Chowla sequence)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A001157 (a(n ) = sigma_2(n ): sum of squares of divisors of n)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A000292 (Tetrahedral numbers (or triangular pyramidal))" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A126796 (Number of complete partitions of n)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A001608 (Perrin sequence)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A055233 (Composite numbers equal to the sum of the primes from their smallest prime factor to their largest prime factor)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A006562 (Balanced primes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000068 (Numbers k such that k^4 + 1 is prime)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A007678 (Number of regions in regular n-gon with all diagonals drawn)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ "Algebra COW Puzzle - Solution" . Archived from the original on 2023-10-19. Retrieved 2023-09-21 .
^ Sloane, N. J. A. (ed.). "Sequence A001845 (Centered octahedral numbers (crystal ball sequence for cubic lattice))" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A306302 (Number of regions into which a figure made up of a row of n adjacent congruent rectangles is divided upon drawing diagonals of all possible rectangles)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A050918 (Woodall primes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A072385 (Primes which can be represented as the sum of a prime and its reverse)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000330 (Square pyramidal numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A005897 (a(n ) = 6*n^2 + 2 for n > 0, a(0)=1)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000569 (Number of graphical partitions of 2n)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A084192 (Array read by antidiagonals: T(n,k) = solution to postage stamp problem with n stamps and k denominations (n >= 1, k >= 1))" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A317712 (Number of uniform rooted trees with n nodes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A162862 (Numbers n such that n^10 + n^9 + n^8 + n^7 + n^6 + n^5 + n^4 + n^3 + n^2 + n + 1 is prime)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A006318 (Large Schröder numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A002955 (Number of (unordered, unlabeled) rooted trimmed trees with n nodes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
t
e
100,000
1,000,000
10,000,000
100,000,000
1,000,000,000
R e t r i e v e d f r o m " https://en.wikipedia.org/w/index.php?title=300_(number)&oldid=1230237392#347 "
C a t e g o r y :
● I n t e g e r s
H i d d e n c a t e g o r i e s :
● A r t i c l e s n e e d i n g a d d i t i o n a l r e f e r e n c e s f r o m M a y 2 0 1 6
● A l l a r t i c l e s n e e d i n g a d d i t i o n a l r e f e r e n c e s
● A r t i c l e s w i t h s h o r t d e s c r i p t i o n
● S h o r t d e s c r i p t i o n m a t c h e s W i k i d a t a
● T h i s p a g e w a s l a s t e d i t e d o n 2 1 J u n e 2 0 2 4 , a t 1 4 : 5 9 ( U T C ) .
● T e x t i s a v a i l a b l e u n d e r t h e C r e a t i v e C o m m o n s A t t r i b u t i o n - S h a r e A l i k e L i c e n s e 4 . 0 ;
a d d i t i o n a l t e r m s m a y a p p l y . B y u s i n g t h i s s i t e , y o u a g r e e t o t h e T e r m s o f U s e a n d P r i v a c y P o l i c y . W i k i p e d i a ® i s a r e g i s t e r e d t r a d e m a r k o f t h e W i k i m e d i a F o u n d a t i o n , I n c . , a n o n - p r o f i t o r g a n i z a t i o n .
● P r i v a c y p o l i c y
● A b o u t W i k i p e d i a
● D i s c l a i m e r s
● C o n t a c t W i k i p e d i a
● C o d e o f C o n d u c t
● D e v e l o p e r s
● S t a t i s t i c s
● C o o k i e s t a t e m e n t
● M o b i l e v i e w