Open main menu

400 (number)

  (Redirected from 463 (number))

400 (four hundred) is the natural number following 399 and preceding 401.

← 399 400 401 →
Cardinalfour hundred
Ordinal400th
(four hundredth)
Factorization24 × 52
Divisors1, 2, 4, 5, 8, 10, 16, 20, 25, 40, 50, 80, 100, 200, 400
Greek numeralΥ´
Roman numeralCD
Binary1100100002
Ternary1122113
Quaternary121004
Quinary31005
Senary15046
Octal6208
Duodecimal29412
Hexadecimal19016
Vigesimal10020
Base 36B436
Hebrewת (Tav)

Mathematical propertiesEdit

400 is the square of 20. 400 is the sum of the powers of 7 from 0 to 3, thus making it a 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 accepted units).

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 fieldsEdit

Four hundred is also

Integers from 401 to 499Edit

400sEdit

401Edit

A prime number, tetranacci number,[1] sum of seven consecutive primes (43 + 47 + 53 + 59 + 61 + 67 + 71), sum of nine consecutive primes (29 + 31 + 37 + 41 + 43 + 47 + 53 + 59 + 61), Chen prime,[2] Eisenstein prime with no imaginary part, Mertens function returns 0,[3] member of the Mian–Chowla sequence.[4]

402Edit

402 = 2 × 3 × 67, sphenic number, nontotient, Harshad number,

403Edit

403 = 13 × 31, Mertens function returns 0.[3]

  • First number that is the product of an emirp pair.[5]
  • HTTP status code for "Forbidden"
  • Also in the name of a retirement plan in the United States, 403(b).
  • The area code for southern Alberta.

404Edit

404 = 22 × 101, Mertens function returns 0,[3] nontotient, noncototient.

405Edit

405 = 34 × 5, Mertens function returns 0,[3] Harshad number;

406Edit

406 = 2 × 7 × 29, sphenic number, triangular number, centered nonagonal number,[6] nontotient

  • HTTP status code for "Not Acceptable".
  • 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.
  • See also the Peugeot 406 car.
  • Area code for all of Montana.

407Edit

407 = 11 × 37,

  • sum of cubes of 4, 0 and 7 (43 + 03 + 73 = 407); narcissistic number[7]
  • sum of three consecutive primes (131 + 137 + 139)
  • Mertens function returns 0[3]
  • Harshad number
  • HTTP status code for "Proxy Authentication Required"
  • Area code for Orlando, Florida
  • Colloquial name for the Express Toll Route in Ontario

408Edit

408 = 23 × 3 × 17

409Edit

409 is a prime number, Chen prime,[2] centered triangular number.[11]

410sEdit

410Edit

410 = 2 × 5 × 41, sphenic number, sum of six consecutive primes (59 + 61 + 67 + 71 + 73 + 79), nontotient, Harshad number

411Edit

411 = 3 × 137, self number,[13]

412Edit

412 = 22 × 103, nontotient, noncototient, sum of twelve consecutive primes (13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53 + 59)

413Edit

413 = 7 × 59, Mertens function returns 0,[3] self number[13]

414Edit

414 = 2 × 32 × 23, Mertens function returns 0,[3] nontotient, Harshad number

415Edit

415 = 5 × 83,

  • 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

416Edit

416 = 25 × 13

417Edit

417 = 3 × 139

418Edit

418 = 2 × 11 × 19, sphenic number,

419Edit

A prime number, Sophie Germain prime,[16] Chen prime, Eisenstein prime with no imaginary part, highly cototient number,[17] Mertens function returns 0[3]

  • refers to the Nigerian advance fee fraud scheme (after the section of the Nigerian Criminal Code it violates)

420sEdit

420Edit

421Edit

  • A prime number, sum of five consecutive primes (73 + 79 + 83 + 89 + 97), centered square number,[18] also SMTP code meaning the transmission channel will be closing
  • Country calling code for Slovakia

422Edit

422 = 2 × 211, Mertens function returns 0,[3] nontotient

423Edit

423 = 32 × 47, Mertens function returns 0,[3] Harshad number

424Edit

424 = 23 × 53, sum of ten consecutive primes (23 + 29 + 31 + 37 + 41 + 43 + 47 + 53 + 59 + 61), Mertens function returns 0,[3] refactorable number,[19] self number[13]

425Edit

425 = 52 × 17, pentagonal number,[20] sum of three consecutive primes (137 + 139 + 149), Mertens function returns 0,[3] the second number that can be expressed as the sum of two squares in three different ways (425 = 202 + 52 = 192 + 82 = 162 + 132 ).

426Edit

426 = 2 × 3 × 71, sphenic number, nontotient,

427Edit

427 = 7 × 61, Mertens function returns 0[3]

428Edit

428 = 22 × 107, Mertens function returns 0, nontotient

429Edit

429 = 3 × 11 × 13, sphenic number, Catalan number[21]

430sEdit

430Edit

430 = 2 × 5 × 43, sphenic number, untouchable number[10]

431Edit

A prime number, Sophie Germain prime,[16] sum of seven consecutive primes (47 + 53 + 59 + 61 + 67 + 71 + 73), Chen prime, Eisenstein prime with no imaginary part

432Edit

432 = 24 × 33 = 42 × 33, The sum of four consecutive primes (103 + 107 + 109 + 113), a highly totient number,[22] 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  .

433Edit

A prime number, Markov number,[23] star number.[24]

  • The perfect score in the game show Fifteen To One, only ever achieved once in over 2000 shows.
  • 433 can refer to composer John Cage's composition 4′33″ (pronounced "Four minutes, thirty-three seconds" or just "Four thirty-three").

434Edit

434 = 2 × 7 × 31, sphenic number, sum of six consecutive primes (61 + 67 + 71 + 73 + 79 + 83), nontotient

435Edit

435 = 3 × 5 × 29, sphenic number, triangular number, hexagonal number,[25] self number[13]

436Edit

436 = 22 × 109, nontotient, noncototient

437Edit

437 = 19 × 23

438Edit

438 = 2 × 3 × 73, sphenic number, Smith number.[26]

439Edit

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[27]

440sEdit

440Edit

440 = 23 × 5 × 11, the sum of the first seventeen prime numbers, Harshad number,

441Edit

441 = 32 × 72 = 212

  • 441 is the sum of the cubes of the first 6 natural numbers (441 = 13 + 23 + 33 + 43 + 53 + 63).
  • 441 is a centered octagonal number,[28] a refactorable number,[19] and a Harshad number.
  • 441 is the number of squares on a Super Scrabble board.

442Edit

442 = 2 × 13 × 17, sphenic number, sum of eight consecutive primes (41 + 43 + 47 + 53 + 59 + 61 + 67 + 71)

443Edit

A prime number, Sophie Germain prime,[16] Chen prime, Eisenstein prime with no imaginary part, Mertens function sets new low of -9, which stands until 659.

  • In computing, it is the default port for HTTPS connections.

444Edit

444 = 22 × 3 × 37, refactorable number,[19] Harshad number.

445Edit

445 = 5 × 89

446Edit

446 = 2 × 223, nontotient, self number[13]

447Edit

447 = 3 × 149

448Edit

448 = 26 × 7, untouchable number,[10] refactorable number,[19] Harshad number

449Edit

A prime number, sum of five consecutive primes (79 + 83 + 89 + 97 + 101), Chen prime, Eisenstein prime with no imaginary part, Proth prime.[29] Also the largest number whose factorial is less than 101000

450sEdit

450Edit

450 = 2 × 32 × 52, nontotient, sum of totient function for first 38 integers, refactorable number,[19] Harshad number,

451Edit

451 = 11 × 41; 451 is a Wedderburn–Etherington number[30] and a centered decagonal number;[31] its reciprocal has period 10; 451 is the smallest number with this period reciprocal length.

452Edit

452 = 22 × 113

  • SMTP code meaning that the requested mail action was not carried out because of insufficient system storage

453Edit

453 = 3 × 151

454Edit

454 = 2 × 227, nontotient, a Smith number[26]

455Edit

455 = 5 × 7 × 13, sphenic number, tetrahedral number[33]

456Edit

456 = 23 × 3 × 19, sum of a twin prime (227 + 229), sum of four consecutive primes (107 + 109 + 113 + 127), centered pentagonal number[34]

457Edit

  • A prime number, sum of three consecutive primes (149 + 151 + 157), self number.[13]
  • The international standard frequency for radio avalanche transceivers (457 kHz).

458Edit

458 = 2 × 229, nontotient

459Edit

459 = 33 × 17

460sEdit

460Edit

460 = 22 × 5 × 23, centered triangular number,[11] dodecagonal number,[35] Harshad number, sum of twelve consecutive primes (17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53 + 59 + 61)

461Edit

A prime number, Chen prime, sexy prime with 467, Eisenstein prime with no imaginary part

462Edit

462 = 2 × 3 × 7 × 11, binomial coefficient  , sum of six consecutive primes (67 + 71 + 73 + 79 + 83 + 89), pronic number,[36] sparsely totient number[37]

463Edit

A prime number, sum of seven consecutive primes (53 + 59 + 61 + 67 + 71 + 73 + 79), centered heptagonal number,[38]

464Edit

464 = 24 × 29, primitive abundant number[39]

  • In chess it is the number of legal positions of the kings, not counting mirrored positions. Has some importance when constructing an endgame tablebase.
  • See also: 4-6-4, the year AD 464.

465Edit

465 = 3 × 5 × 31, sphenic number, triangular number, member of the Padovan sequence,[40] Harshad number

466Edit

466 = 2 × 233, noncototient

467Edit

A prime number, safe prime,[41] sexy prime with 461, Chen prime, Eisenstein prime with no imaginary part

468Edit

468 = 22 × 32 × 13, sum of ten consecutive primes (29 + 31 + 37 + 41 + 43 + 47 + 53 + 59 + 61 + 67), refactorable number,[19] self number,[13] Harshad number

469Edit

469 = 7 × 67, centered hexagonal number[42]

470sEdit

470Edit

470 = 2 × 5 × 47, sphenic number, nontotient, noncototient

  • 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

471Edit

471 = 3 × 157, sum of three consecutive primes (151 + 157 + 163), perfect totient number[43]

472Edit

472 = 23 × 59, nontotient, untouchable number,[10] refactorable number[19]

473Edit

473 = 11 × 43, sum of five consecutive primes (83 + 89 + 97 + 101 + 103)

474Edit

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,[10] nonagonal number[44]

475Edit

475 = 52 × 19, 49-gonal number, member of the Mian–Chowla sequence.[4]

476Edit

476 = 22 × 7 × 17, Harshad number

477Edit

477 = 32 × 53, pentagonal number[20]

478Edit

478 = 2 × 239

479Edit

A prime number, safe prime,[41] sum of nine consecutive primes (37 + 41 + 43 + 47 + 53 + 59 + 61 + 67 + 71), Chen prime, Eisenstein prime with no imaginary part, self number[13]

480sEdit

480Edit

480 = 25 × 3 × 5, sum of a twin prime (239 + 241), sum of four consecutive primes (109 + 113 + 127 + 131), highly totient number,[22] refactorable number,[19] Harshad number

481Edit

481 = 13 × 37, octagonal number,[9] centered square number,[18] Harshad number

482Edit

482 = 2 × 241, nontotient, noncototient

483Edit

483 = 3 × 7 × 23, sphenic number, Smith number[26]

484Edit

484 = 22 × 112 = 222, nontotient

485Edit

485 = 5 × 97

486Edit

486 = 2 × 35, Harshad number, Perrin number[45]

487Edit

A prime number, sum of three consecutive primes (157 + 163 + 167), Chen prime,

  • The only primes under 7.74 × 1013 that divide their own decimal repetends are 3, 487, and 56598313.[46]
  • Shorthand for the Intel 80487 floating point processor chip.

488Edit

488 = 23 × 61, nontotient, refactorable number[19]

489Edit

489 = 3 × 163, octahedral number[47]

490sEdit

490Edit

490 = 2 × 5 × 72, noncototient, sum of totient function for first 40 integers, partition number (integer partitions of 19),[48] self number.[13]

491Edit

A prime number, Sophie Germain prime,[16] Chen prime, Eisenstein prime with no imaginary part, strictly non-palindromic number[27]

492Edit

492 = 22 × 3 × 41, sum of six consecutive primes (71 + 73 + 79 + 83 + 89 + 97), refactorable number,[19] member of a Ruth–Aaron pair with 493 under first definition

493Edit

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

494Edit

494 = 2 × 13 × 19, sphenic number, nontotient

495Edit

496Edit

496 is the third perfect number, a number whose divisors add up to the actual number (1+2+4+8+16+31+62+124+248=496).

497Edit

497 = 7 × 71, sum of five consecutive primes (89 + 97 + 101 + 103 + 107)

498Edit

498 = 2 × 3 × 83, sphenic number, untouchable number,[10] admirable number,[49] abundant number

499Edit

A prime number, Chen prime

ReferencesEdit

  1. ^ "Sloane's A000078 : Tetranacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  2. ^ a b "Sloane's A109611 : Chen primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  3. ^ a b c d e f g h i j k l m n "Sloane's A028442 : Numbers n such that Mertens' function is zero". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  4. ^ a b "Sloane's A005282 : Mian-Chowla sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  5. ^ Sloane, N. J. A. (ed.). "Sequence A083815". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  6. ^ "Sloane's A060544 : Centered 9-gonal (also known as nonagonal or enneagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  7. ^ "Sloane's A005188 : Armstrong (or Plus Perfect, or narcissistic) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  8. ^ "Sloane's A000129 : Pell numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  9. ^ a b "Sloane's A000567 : Octagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  10. ^ a b c d e f "Sloane's A005114 : Untouchable numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  11. ^ a b "Sloane's A005448 : Centered triangular numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  12. ^ Google Maps [@googlemaps] (16 June 2016). "117 islands, 150 canals, 409 bridges. Explore #Venice with this #GoogleMaps Trek" (Tweet) – via Twitter.
  13. ^ a b c d e f g h i "Sloane's A003052 : Self numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  14. ^ L. Masinter (1 April 1998). "Hyper Text Coffee Pot Control Protocol (HTCPCP/1.0)". Network Working Group (RFC). 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.
  15. ^ I. Nazar (1 April 2014). "The Hyper Text Coffee Pot Control Protocol for Tea Efflux Appliances (HTCPCP-TEA)" (RFC). 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.
  16. ^ a b c d "Sloane's A005384 : Sophie Germain primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  17. ^ "Sloane's A100827 : Highly cototient numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  18. ^ a b "Sloane's A001844 : Centered square numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  19. ^ a b c d e f g h i j "Sloane's A0033950 : Refactorable numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  20. ^ a b "Sloane's A000326 : Pentagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  21. ^ "Sloane's A000108 : Catalan numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  22. ^ a b "Sloane's A097942 : Highly totient numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  23. ^ "Sloane's A002559 : Markoff (or Markov) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  24. ^ "Sloane's A003154 : Centered 12-gonal numbers. Also star numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  25. ^ "Sloane's A000384 : Hexagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  26. ^ a b c "Sloane's A006753 : Smith numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  27. ^ a b "Sloane's A016038 : Strictly non-palindromic numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  28. ^ "Sloane's A016754 : Odd squares: a(n) = (2n+1)^2. Also centered octagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  29. ^ "Sloane's A080076 : Proth primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  30. ^ "Sloane's A001190 : Wedderburn-Etherington numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  31. ^ "Sloane's A062786 : Centered 10-gonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  32. ^ https://datatracker.ietf.org/doc/draft-ietf-httpbis-legally-restricted-status/
  33. ^ "Sloane's A000292 : Tetrahedral numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  34. ^ "Sloane's A005891 : Centered pentagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  35. ^ "Sloane's A051624 : 12-gonal (or dodecagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  36. ^ "Sloane's A002378 : Oblong (or promic, pronic, or heteromecic) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  37. ^ "Sloane's A036913 : Sparsely totient numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  38. ^ "Sloane's A069099 : Centered heptagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  39. ^ "Sloane's A091191 : Primitive abundant numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  40. ^ "Sloane's A000931 : Padovan sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  41. ^ a b "Sloane's A005385 : Safe primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  42. ^ "Sloane's A003215 : Hex (or centered hexagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  43. ^ "Sloane's A082897 : Perfect totient numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  44. ^ "Sloane's A001106 : 9-gonal (or enneagonal or nonagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  45. ^ "Sloane's A001608 : Perrin sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  46. ^ "Sloane's A045616 : Primes p such that 10^(p-1) == 1 (mod p^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2018-05-31.
  47. ^ "Sloane's A005900 : Octahedral numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  48. ^ "Sloane's A000041 : a(n) = number of partitions of n (the partition numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.
  49. ^ "Sloane's A111592 : Admirable numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-10.