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 O t h e r f i e l d s
3 I n t e g e r s f r o m 4 0 1 t o 4 9 9
T o g g l e I n t e g e r s f r o m 4 0 1 t o 4 9 9 s u b s e c t i o n
3 . 1 4 0 0 s
3 . 1 . 1 4 0 1
3 . 1 . 2 4 0 2
3 . 1 . 3 4 0 3
3 . 1 . 4 4 0 4
3 . 1 . 5 4 0 5
3 . 1 . 6 4 0 6
3 . 1 . 7 4 0 7
3 . 1 . 8 4 0 8
3 . 1 . 9 4 0 9
3 . 2 4 1 0 s
3 . 2 . 1 4 1 0
3 . 2 . 2 4 1 1
3 . 2 . 3 4 1 2
3 . 2 . 4 4 1 3
3 . 2 . 5 4 1 4
3 . 2 . 6 4 1 5
3 . 2 . 7 4 1 6
3 . 2 . 8 4 1 7
3 . 2 . 9 4 1 8
3 . 2 . 1 0 4 1 9
3 . 3 4 2 0 s
3 . 3 . 1 4 2 0
3 . 3 . 2 4 2 1
3 . 3 . 3 4 2 2
3 . 3 . 4 4 2 3
3 . 3 . 5 4 2 4
3 . 3 . 6 4 2 5
3 . 3 . 7 4 2 6
3 . 3 . 8 4 2 7
3 . 3 . 9 4 2 8
3 . 3 . 1 0 4 2 9
3 . 4 4 3 0 s
3 . 4 . 1 4 3 0
3 . 4 . 2 4 3 1
3 . 4 . 3 4 3 2
3 . 4 . 4 4 3 3
3 . 4 . 5 4 3 4
3 . 4 . 6 4 3 5
3 . 4 . 7 4 3 6
3 . 4 . 8 4 3 7
3 . 4 . 9 4 3 8
3 . 4 . 1 0 4 3 9
3 . 5 4 4 0 s
3 . 5 . 1 4 4 0
3 . 5 . 2 4 4 1
3 . 5 . 3 4 4 2
3 . 5 . 4 4 4 3
3 . 5 . 5 4 4 4
3 . 5 . 6 4 4 5
3 . 5 . 7 4 4 6
3 . 5 . 8 4 4 7
3 . 5 . 9 4 4 8
3 . 5 . 1 0 4 4 9
3 . 6 4 5 0 s
3 . 6 . 1 4 5 0
3 . 6 . 2 4 5 1
3 . 6 . 3 4 5 2
3 . 6 . 4 4 5 3
3 . 6 . 5 4 5 4
3 . 6 . 6 4 5 5
3 . 6 . 7 4 5 6
3 . 6 . 8 4 5 7
3 . 6 . 9 4 5 8
3 . 6 . 1 0 4 5 9
3 . 7 4 6 0 s
3 . 7 . 1 4 6 0
3 . 7 . 2 4 6 1
3 . 7 . 3 4 6 2
3 . 7 . 4 4 6 3
3 . 7 . 5 4 6 4
3 . 7 . 6 4 6 5
3 . 7 . 7 4 6 6
3 . 7 . 8 4 6 7
3 . 7 . 9 4 6 8
3 . 7 . 1 0 4 6 9
3 . 8 4 7 0 s
3 . 8 . 1 4 7 0
3 . 8 . 2 4 7 1
3 . 8 . 3 4 7 2
3 . 8 . 4 4 7 3
3 . 8 . 5 4 7 4
3 . 8 . 6 4 7 5
3 . 8 . 7 4 7 6
3 . 8 . 8 4 7 7
3 . 8 . 9 4 7 8
3 . 8 . 1 0 4 7 9
3 . 9 4 8 0 s
3 . 9 . 1 4 8 0
3 . 9 . 2 4 8 1
3 . 9 . 3 4 8 2
3 . 9 . 4 4 8 3
3 . 9 . 5 4 8 4
3 . 9 . 6 4 8 5
3 . 9 . 7 4 8 6
3 . 9 . 8 4 8 7
3 . 9 . 9 4 8 8
3 . 9 . 1 0 4 8 9
3 . 1 0 4 9 0 s
3 . 1 0 . 1 4 9 0
3 . 1 0 . 2 4 9 1
3 . 1 0 . 3 4 9 2
3 . 1 0 . 4 4 9 3
3 . 1 0 . 5 4 9 4
3 . 1 0 . 6 4 9 5
3 . 1 0 . 7 4 9 6
3 . 1 0 . 8 4 9 7
3 . 1 0 . 9 4 9 8
3 . 1 0 . 1 0 4 9 9
4 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
4 0 0 ( n u m b e r )
5 1 l a n g u a g e s
● А ԥ с ш ә а ● ا ل ع ر ب ي ة ● Ա ր ե ւ մ տ ա հ ա յ ե ր է ն ● A z ə r b a y c a n c a ● B a s a B a l i ● 閩 南 語 / 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 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 ● ꯃ ꯤ ꯇ ꯩ ꯂ ꯣ ꯟ ● 日 本 語 ● 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 ● י י ִ ד י ש ● 粵 語 ● 中 文
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 4 4 9 ( n u m b e r ) )
This article is about the numbers 400 to 499. For the year 400 AD, see
400 . For other uses, see
400 (disambiguation) .
Natural number
Cardinal four hundred Ordinal 400th Factorization 2 4 2 Divisors 1, 2, 4, 5, 8, 10, 16, 20, 25, 40, 50, 80, 100, 200, 400 Greek numeral Υ´ Roman numeral CD Binary 1100100002 Ternary 1122113 Senary 15046 Octal 6208 Duodecimal 29412 Hexadecimal 19016 Hebrew ת Armenian Ն Babylonian cuneiform 𒐚𒐏 Egyptian hieroglyph 𓍥
400 (four hundred ) is the natural number following 399 and preceding 401 .
Mathematical properties [ edit ]
400 is the square of 20 repdigit in base 7 (1111).
A circle is divided into 400 grads , which is equal to 360 degrees and 2π radians . (Degrees and radians are the SI
400 is a self number in base 10, since there is no integer that added to the sum of its own digits results in 400. On the other hand, 400 is divisible by the sum of its own base 10 digits, making it a Harshad number .
Other fields [ edit ]
Four hundred is also
.400 (2 hits out of 5 at-bats) is a numerically significant annual batting average statistic in Major League Baseball, last accomplished by Ted Williams of the Boston Red Sox in 1941.
The number of days in a Gregorian calendar year changes according to a cycle of exactly 400 years, of which 97 are leap years and 303 are common.
The Sun is approximately 400 times the size of the Moon but is also approximately 400 times farther away from Earth than the Moon is, thus creating the illusion in which the Sun and the Moon in Earth's sky appear to be of similar size.[1]
In gematria 400 is the largest single number that can be represented without using the Sophit forms (see Kaph , Mem , Nun , Pe Tzade ).
Integers from 401 to 499 [ edit ]
401 is a prime number , tetranacci number ,[2] Chen prime ,[3] prime index prime
402 = 2 × 3 × 67, sphenic number , nontotient , Harshad number , number of graphs with 8 nodes and 9 edges[6]
403 = 13 × 31, heptagonal number , Mertens function returns 0.[4]
404 = 22 [4] noncototient , number of integer partitions of 20 with an alternating permutation.[8]
405 = 34 [4] Harshad number , pentagonal pyramidal number ;
406 = 2 × 7 × 29, sphenic number , triangular number , centered nonagonal number ,[9]
406 is a poem by John Boyle O'Reilly . It was believed to have been the number of one of O'Reilly's prison cells, and was the number of his first hotel room after he arrived in the United States. Hence the number had a mystical significance to him, as intimated in the poem.
Peugeot 406 car.
Area code for all of Montana .
407 = 11 × 37,
Sum of cubes of 4, 0 and 7 (4 3 3 3 narcissistic number [10]
Sum of three consecutive primes (131 + 137 + 139)
Mertens function returns 0[4]
Harshad number
Lazy caterer number [11]
HTTP status code for "Proxy Authentication Required"
Area code for Orlando , Florida
Colloquial name for the Express Toll Route in Ontario
408 = 23 17
409 is a prime number, Chen prime ,[3] centered triangular number .[15]
410 = 2 × 5 × 41, sphenic number , sum of six consecutive primes (59 + 61 + 67 + 71 + 73 + 79), nontotient, Harshad number, number of triangle-free graphs on 8 vertices[17]
411 = 3 × 137, self number ,[18]
412 = 22 41264
413 = 7 × 59, Mertens function returns 0,[4] [18] Blum integer
414 = 2 ×3 2 [4] [19]
∑
n =
0
10
414
n
{\displaystyle \sum _{n=0}^{10}{414}^{n}}
[20]
415 = 5 × 83, logarithmic number[21]
HTTP status code for "Unsupported Media Type"
415 Records , a record label
415 refers to California Penal Code , section 415, pertaining to public fighting, public disturbance, and public use of offensive words likely to provoke an immediate violent reaction.
Area code 415 , a telephone area code for San Francisco, California
416 = 25 independent vertex sets and vertex covers in the 6-sunlet graph [22]
417 = 3 × 139, Blum integer
418 = 2 × 11 × 19; sphenic number ,[23] [24] gonal number.[25]
A prime number, Sophie Germain prime ,[29] [3] highly cototient number ,[30] [4]
Refers to the Nigerian advance fee fraud scheme (after the section of the Nigerian Criminal Code it violates)
The Area Code for Toledo, OH and other surrounding areas.
422 = 2 × 211, Mertens function returns 0,[4] 2 intersecting circles divide the plane .[32]
423 = 32 [4] Harshad number , number of secondary structures of RNA molecules with 10 nucleotides[33]
424 = 23 [4] refactorable number ,[34] [18]
425 = 52 pentagonal number ,[35] centered tetrahedral number , sum of three consecutive primes (137 + 139 + 149), Mertens function returns 0,[4] 2 2 2 2 2 2
426 = 2 × 3 × 71, sphenic number, nontotient, untouchable number
427 = 7 × 61, Mertens function returns 0.[4]
428 = 22 32 [36]
429 = 3 × 11 × 13, sphenic number, Catalan number [37]
430 = 2 × 5 × 43, number of primes below 3000, sphenic number, untouchable number[14]
A prime number, Sophie Germain prime ,[29] Chen prime ,[3] prime index prime , Eisenstein prime with no imaginary part
432 = 24 3 2 3 highly totient number ,[38] an Achilles number and the sum of totient function for first 37 integers. 432! is the first factorial that is not a Harshad number in base 10. 432 is also three-dozen sets of a dozen, making it three gross. An equilateral triangle whose area and perimeter are equal, has an area (and perimeter) equal to
432
{\displaystyle {\sqrt {432}}}
A prime number, Markov number ,[39] star number .[40]
The perfect score in the game show Fifteen To One
433 can refer to composer John Cage 's composition 4 ′33 ″
434 = 2 × 7 × 31, sphenic number, sum of six consecutive primes (61 + 67 + 71 + 73 + 79 + 83), nontotient, maximal number of pieces that can be obtained by cutting an annulus with 28 cuts[41]
435 = 3 × 5 × 29, sphenic number, triangular number, hexagonal number ,[42] [18] [43]
436 = 22 [11]
437 = 19 × 23, Blum integer
438 = 2 × 3 × 73, sphenic number, Smith number .[44]
A prime number, sum of three consecutive primes (139 + 149 + 151), sum of nine consecutive primes (31 + 37 + 41 + 43 + 47 + 53 + 59 + 61 + 67), strictly non-palindromic number[45]
441 = 32 7 2 2
441 is the sum of the cubes of the first 6 natural numbers (441 = 13 3 3 3 3 3
441 is a centered octagonal number ,[46] [34]
441 is the number of squares on a Super Scrabble board.
442 = 2 × 13 × 17 = 212 [47]
A prime number, Sophie Germain prime,[29] [3]
In computing, it is the default port for HTTPS connections.
444 = 22 [34] Harshad number , number of noniamonds without holes,[48] repdigit .
445 = 5 × 89, number of series-reduced trees with 17 nodes[49]
446 = 2 × 223, nontotient, self number[18]
447 = 3 × 149, number of 1's in all partitions of 22 into odd parts[50]
448 = 26 [14] [34]
A prime number, sum of five consecutive primes (79 + 83 + 89 + 97 + 101), Chen prime,[3] Proth prime .[51] factorial is less than 101000
450 = 2 ×3 2 5 2 [34]
451 = 11 × 41; 451 is a Wedderburn–Etherington number [52] centered decagonal number ;[53] reciprocal length .
452 = 22 [55]
SMTP code meaning that the requested mail action was not carried out because of insufficient system storage
453 = 3 × 151, Blum integer
454 = 2 × 227, nontotient, a Smith number [44]
455 = 5 × 7 × 13, sphenic number , tetrahedral number [56]
456 = 23 centered pentagonal number ,[58] icosahedral number
A prime number, sum of three consecutive primes (149 + 151 + 157), self number.[18]
The international standard frequency for radio avalanche transceivers (457 kHz).
458 = 2 × 229, nontotient, number of partitions of 24 into divisors of 24[59]
459 = 33 [60]
460 = 22 [15] [61] Harshad number , sum of twelve consecutive primes (17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53 + 59 + 61)
A prime number, Chen prime,[3] sexy prime with 467, Eisenstein prime with no imaginary part, prime index prime
462 = 2 × 3 × 7 × 11, binomial coefficient
(
11 5
)
{\displaystyle {\tbinom {11}{5}}}
stirling number of the second kind
{
9 7
}
{\displaystyle \left\{{9 \atop 7}\right\}}
pronic number ,[62] sparsely totient number ,[63] idoneal number
A prime number, sum of seven consecutive primes (53 + 59 + 61 + 67 + 71 + 73 + 79), centered heptagonal number .[64]
464 = 24 primitive abundant number ,[65] 2 intersecting circles divide the plane ,[32] [41]
In chess it is the number of legal positions of the kings, not counting mirrored positions. Has some importance when constructing an endgame tablebase .
Model number of the home computer Amstrad CPC 464 .
465 = 3 × 5 × 31, sphenic number , triangular number, member of the Padovan sequence ,[66]
466 = 2 × 233, noncototient, lazy caterer number.[11]
A prime number, safe prime ,[67] sexy prime with 461, Chen prime,[3]
∑
n =
0
10
467
n
{\displaystyle \sum _{n=0}^{10}{467}^{n}}
[20]
468 = 22 3 2 [34] [18]
469 = 7 × 67, centered hexagonal number .[68]
470 = 2 × 5 × 47, sphenic number, nontotient, noncototient, cake number
In golf , 470 is the minimum length in yards from the tee to the hole on a Par 5.
470 is an Olympic class of sailing dinghy
471 = 3 × 157, sum of three consecutive primes (151 + 157 + 163), perfect totient number ,[69] [70]
472 = 23 [14] [34] [71]
The Amstrad CPC472 was a short-lived home computer for the Spanish market.
473 = 11 × 43, sum of five consecutive primes (83 + 89 + 97 + 101 + 103), Blum integer
474 = 2 × 3 × 79, sphenic number, sum of eight consecutive primes (43 + 47 + 53 + 59 + 61 + 67 + 71 + 73), nontotient, noncototient, sum of totient function for first 39 integers, untouchable number,[14] nonagonal number [72]
475 = 52 gonal number , member of the Mian–Chowla sequence.[5]
476 = 22 Harshad number , admirable number[73]
477 = 32 pentagonal number [35]
478 = 2 × 239, Companion Pell number , number of partitions of 26 that do not contain 1 as a part[74]
A prime number, safe prime,[67] [3] [18]
480 = 25 [38] [34]
∑
n =
0
10
480
n
{\displaystyle \sum _{n=0}^{10}{480}^{n}}
[20]
481 = 13 × 37, octagonal number,[13] [31]
482 = 2 × 241, nontotient, noncototient, number of series-reduced planted trees with 15 nodes[75]
483 = 3 × 7 × 23, sphenic number, Smith number[44]
484 = 22 11 2 2
485 = 5 × 97, number of triangles (of all sizes, including holes) in Sierpiński's triangle after 5 inscriptions[76]
486 = 2 ×3 5 Perrin number [77]
A prime number, sum of three consecutive primes (157 + 163 + 167), Chen prime,[3]
The only primes under 7.74 ×10 13 decimal repetends are 3, 487, and 56598313.[78]
Shorthand for the Intel 80487 floating point processor chip.
488 = 23 [34] [70] [79]
489 = 3 × 163, octahedral number [80]
490 = 2 × 5 ×7 2 integer partitions of 19,[81] [18]
A prime number, isolated prime, Sophie Germain prime ,[29] [3] [45]
492 = 22 [34] Ruth–Aaron pair with 493 under first definition
493 = 17 × 29, sum of seven consecutive primes (59 + 61 + 67 + 71 + 73 + 79 + 83), member of a Ruth–Aaron pair with 492 under first definition, the 493d centered octagonal number is also a centered square number[82]
494 = 2 × 13 × 19 =
⟨
⟨
8 1
⟩
⟩
{\displaystyle \left\langle \!\!\left\langle {8 \atop 1}\right\rangle \!\!\right\rangle }
[83]
497 = 7 × 71, sum of five consecutive primes (89 + 97 + 101 + 103 + 107), lazy caterer number.[11]
498 = 2 × 3 × 83, sphenic number, untouchable number,[14] [84]
A prime number, isolated prime, Chen prime,[3] 4 499 - 3499 is prime
References [ edit ]
^ a b c d e f g h i j k l Sloane, N. J. A. (ed.). "Sequence A109611 (Chen primes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b c d e f g h i j k l m n Sloane, N. J. A. (ed.). "Sequence A028442 (Numbers n such that Mertens' function is zero)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b 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 A008406 (Triangle T(n,k) read by rows, giving number of graphs with n nodes (n >= 1) and k edges (0 <= k <= n(n-1)/2))" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A083815 (Semiprimes whose prime factors are distinct and the reversal of one factor is equal to the other)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A345170 (Number of integer partitions of n with an alternating permutation)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A060544 (Centered 9-gonal (also known as nonagonal or enneagonal) numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A005188 (Armstrong (or Plus Perfect, or narcissistic) numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b c d 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 A000129 (Pell numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A000567 (Octagonal 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)" . 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.
^ "Venice: The City Built on Water" . Google Maps . Retrieved 2022-09-21 .
^ Sloane, N. J. A. (ed.). "Sequence A006785 (Number of triangle-free graphs on n vertices)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b c d e f g h i Sloane, N. J. A. (ed.). "Sequence A003052 (Self numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A047993 (Number of balanced partitions of n: the largest part equals the number of parts)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b c 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 A002104 (Logarithmic numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A080040 (a(n ) = 2*a(n-1) + 2*a(n-2) for n > 1; a(0)=2, a(1 )=2)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A007304 (Sphenic numbers: products of 3 distinct primes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A020492 (Balanced numbers: numbers k such that phi(k ) (A000010) divides sigma(k ) (A000203))" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Conway, John H. ; Guy, Richard (2012). The Book of Numbers Springer . p. 39. doi :10.1007/978-1-4612-4072-3 . ISBN 978-1-4612-4072-3 OCLC 39220031 .
^ Sloane, N. J. A. (ed.). "Sequence A040017 (Unique period primes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2022-05-20 .
That number is 142,857,157,142,857,142,856,999,999,985,714,285,714,285,857,142,857,142,855,714,285,571,428,571,428,572,857,143 .
^ L. Masinter (1 April 1998). "Hyper Text Coffee Pot Control Protocol (HTCPCP/1.0)" . Network Working Group (RFC). doi :10.17487/RFC2324 . Retrieved 13 Sep 2018 . Any attempt to brew coffee with a teapot should result in the error code "418 I'm a teapot". The resulting entity body MAY be short and stout.
^ I. Nazar (1 April 2014). "The Hyper Text Coffee Pot Control Protocol for Tea Efflux Appliances (HTCPCP-TEA)" . IETF Request for Comments (RFC) Pages - Test (RFC). doi :10.17487/RFC7168 . ISSN 2070-1721 . Retrieved 13 Sep 2018 . TEA-capable pots that are not provisioned to brew coffee may return either a status code of 503, indicating temporary unavailability of coffee, or a code of 418 as defined in the base HTCPCP specification to denote a more permanent indication that the pot is a teapot.
^ a b c d Sloane, N. J. A. (ed.). "Sequence A005384 (Sophie Germain primes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ 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 A001844 (Centered square numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A014206 (a(n ) = n^2 + n + 2)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A004148 (Generalized Catalan 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 A033950 (Refactorable 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 A006315 (Numbers n such that n^32 + 1 is prime)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000108 (Catalan numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A097942 (Highly totient numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A002559 (Markoff (or Markov) numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A003154 (Centered 12-gonal numbers. Also star numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A000096 (a(n ) = n*(n+3)/2)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000384 (Hexagonal numbers)" . 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.
^ a b c Sloane, N. J. A. (ed.). "Sequence A006753 (Smith numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A016038 (Strictly non-palindromic numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A016754 (Odd squares: a(n ) = (2n+1)^2. Also centered octagonal numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A002522 (a(n ) = n^2 + 1)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A070765 (Number of polyiamonds with n cells, without holes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000014 (Number of series-reduced trees with n nodes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A036469 (Partial sums of A000009 (partitions into distinct parts))" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A080076 (Proth primes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A001190 (Wedderburn-Etherington numbers)" . 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.
^ "451 Unavailable For Legal Reasons - HTTP | MDN" . developer.mozilla.org . Retrieved 2021-04-23 .
^ Sloane, N. J. A. (ed.). "Sequence A005893 (Number of points on surface of tetrahedron)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000292 (Tetrahedral numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A111441 (Numbers k such that the sum of the squares of the first k primes is divisible by k)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A005891 (Centered pentagonal numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A018818 (Number of partitions of n into divisors of n)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A045943 (Triangular matchstick numbers: a(n ) = 3*n*(n+1)/2)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A051624 (12-gonal (or dodecagonal) numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A002378 (Oblong (or promic, pronic, or heteromecic) 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.
^ Sloane, N. J. A. (ed.). "Sequence A069099 (Centered heptagonal numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A091191 (Primitive abundant 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.
^ 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 A003215 (Hex (or centered hexagonal) numbers)" . 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.
^ a b Sloane, N. J. A. (ed.). "Sequence A006872 (Numbers k such that phi(k ) = phi(sigma(k )))" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A045846 (Number of distinct ways to cut an n X n square into squares with integer sides)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A001106 (9-gonal (or enneagonal or nonagonal) numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A111592 (Admirable numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A002865 (Number of partitions of n that do not contain 1 as a part)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A001678 (Number of series-reduced planted trees with n nodes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A048473 (a(0)=1, a(n ) = 3*a(n-1) + 2; a(n ) = 2*3^n - 1)" . 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 A045616 (Primes p such that 10^(p-1) == 1 (mod p^2))" . 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 A005900 (Octahedral numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000041 (a(n ) = number of partitions of n (the partition numbers))" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A011900 (a(n ) = 6*a(n-1) - a(n-2) - 2 with a(0) = 1, a(1 ) = 3)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A008517 (Second-order Eulerian triangle T(n, k), 1 <= k <= n)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A111592 (Admirable numbers)" . 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=400_(number)&oldid=1226425528#449 " 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 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 ● 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 J u n e 2 0 2 3 ● 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 J 9 U i d e n t i f i e r s ● A r t i c l e s w i t h L C C N i d e n t i f i e r s
● T h i s p a g e w a s l a s t e d i t e d o n 3 0 M a y 2 0 2 4 , a t 1 5 : 2 2 ( 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
is prime[20]
is prime[20]
is prime[20]
