Recent from talks
All channels
Be the first to start a discussion here.
Be the first to start a discussion here.
Be the first to start a discussion here.
Be the first to start a discussion here.
Welcome to the community hub built to collect knowledge and have discussions related to 800 (number).
Nothing was collected or created yet.
800 (number)
View on Wikipediafrom Wikipedia
| ||||
|---|---|---|---|---|
| Cardinal | eight hundred | |||
| Ordinal | 800th (eight hundredth) | |||
| Factorization | 25 × 52 | |||
| Divisors | 1,2,4,5,8,10,16,20,25,32,40,50,80,100,160,200,400,800 | |||
| Greek numeral | Ω´ | |||
| Roman numeral | DCCC, dccc | |||
| Binary | 11001000002 | |||
| Ternary | 10021223 | |||
| Senary | 34126 | |||
| Octal | 14408 | |||
| Duodecimal | 56812 | |||
| Hexadecimal | 32016 | |||
| Armenian | Պ | |||
| Hebrew | ת"ת / ף | |||
| Babylonian cuneiform | 𒌋𒐗⟪ | |||
| Egyptian hieroglyph | 𓍩 | |||
800 (eight hundred) is the natural number following 799 and preceding 801.
It is the sum of four consecutive primes (193 + 197 + 199 + 211). It is a Harshad number, an Achilles number and the area of a square with diagonal 40.[1]
Integers from 801 to 899
[edit]800s
[edit]- 801 = 32 × 89, Harshad number, number of clubs patterns appearing in 50 × 50 coins[2]
- 802 = 2 × 401, sum of eight consecutive primes (83 + 89 + 97 + 101 + 103 + 107 + 109 + 113), nontotient, happy number, sum of 4 consecutive triangular numbers[3] (171 + 190 + 210 + 231)
- 803 = 11 × 73, sum of three consecutive primes (263 + 269 + 271), sum of nine consecutive primes (71 + 73 + 79 + 83 + 89 + 97 + 101 + 103 + 107), Harshad number, number of partitions of 34 into Fibonacci parts[4]
- 804 = 22 × 3 × 67, nontotient, Harshad number, refactorable number[5]
- "The 804" is a local nickname for the Greater Richmond Region of the U.S. state of Virginia, derived from its telephone area code (although the area code covers a larger area).[6][7]
- 805 = 5 × 7 × 23, sphenic number, number of partitions of 38 into nonprime parts[8]
- 806 = 2 × 13 × 31, sphenic number, nontotient, totient sum for first 51 integers, happy number, Phi(51)[9]
- 807 = 3 × 269, antisigma(42)[10]
- 808 = 23 × 101, refactorable number, strobogrammatic number[11]
- 809 = prime number, Sophie Germain prime,[12] Chen prime, Eisenstein prime with no imaginary part
810s
[edit]- 810 = 2 × 34 × 5, Harshad number, number of distinct reduced words of length 5 in the Coxeter group of "Apollonian reflections" in three dimensions,[13] number of non-equivalent ways of expressing 100,000 as the sum of two prime numbers[14]
- 811 = prime number, twin prime, sum of five consecutive primes (151 + 157 + 163 + 167 + 173), Chen prime, happy number, largest minimal prime in base 9, the Mertens function of 811 returns 0
- 812 = 22 × 7 × 29, admirable number, pronic number,[15] balanced number,[16] the Mertens function of 812 returns 0
- 813 = 3 × 271, Blum integer (sequence A016105 in the OEIS)
- 814 = 2 × 11 × 37, sphenic number, the Mertens function of 814 returns 0, nontotient, number of fixed hexahexes.
- 815 = 5 × 163, number of graphs with 8 vertices and a distinguished bipartite block[17]
- 816 = 24 × 3 × 17, tetrahedral number,[18] Padovan number,[19] Zuckerman number
- 817 = 19 × 43, sum of three consecutive primes (269 + 271 + 277), centered hexagonal number[20]
- 818 = 2 × 409, nontotient, strobogrammatic number[11]
- 819 = 32 × 7 × 13, square pyramidal number[21]
820s
[edit]- 820 = 22 × 5 × 41, 40th triangular number, smallest triangular number that starts with the digit 8,[22] Harshad number, happy number, repdigit (1111) in base 9
- 821 = prime number, twin prime, Chen prime, Eisenstein prime with no imaginary part, lazy caterer number (sequence A000124 in the OEIS), prime quadruplet with 823, 827, 829
- 822 = 2 × 3 × 137, sum of twelve consecutive primes (43 + 47 + 53 + 59 + 61 + 67 + 71 + 73 + 79 + 83 + 89 + 97), sphenic number, member of the Mian–Chowla sequence[23]
- 823 = prime number, twin prime, lucky prime, the Mertens function of 823 returns 0, prime quadruplet with 821, 827, 829
- 824 = 23 × 103, refactorable number, sum of ten consecutive primes (61 + 67 + 71 + 73 + 79 + 83 + 89 + 97 + 101 + 103), the Mertens function of 824 returns 0, nontotient
- 825 = 3 × 52 × 11, Smith number,[24] the Mertens function of 825 returns 0, Harshad number
- 826 = 2 × 7 × 59, sphenic number, number of partitions of 29 into parts each of which is used a different number of times[25]
- 827 = prime number, twin prime, part of prime quadruplet with {821, 823, 829}, sum of seven consecutive primes (103 + 107 + 109 + 113 + 127 + 131 + 137), Chen prime, Eisenstein prime with no imaginary part, strictly non-palindromic number[26]
- 828 = 22 × 32 × 23, Harshad number, triangular matchstick number[27]
- 829 = prime number, twin prime, part of prime quadruplet with {827, 823, 821}, sum of three consecutive primes (271 + 277 + 281), Chen prime, centered triangular number
830s
[edit]- 830 = 2 × 5 × 83, sphenic number, sum of four consecutive primes (197 + 199 + 211 + 223), nontotient, totient sum for first 52 integers
- 831 = 3 × 277, number of partitions of 32 into at most 5 parts[28]
- 832 = 26 × 13, Harshad number, member of the sequence Horadam(0, 1, 4, 2)[29]
- 833 = 72 × 17, octagonal number (sequence A000567 in the OEIS), a centered octahedral number[30]
- 834 = 2 × 3 × 139, cake number, sphenic number, sum of six consecutive primes (127 + 131 + 137 + 139 + 149 + 151), nontotient
- 835 = 5 × 167, Motzkin number[31]
- 836 = 22 × 11 × 19, weird number
- 837 = 33 × 31, the 36th generalized heptagonal number[32]
- 838 = 2 × 419, palindromic number, number of distinct products ijk with 1 <= i<j<k <= 23[33]
- 839 = prime number, safe prime,[34] sum of five consecutive primes (157 + 163 + 167 + 173 + 179), Chen prime, Eisenstein prime with no imaginary part, highly cototient number[35]
840s
[edit]- 840 = 23 × 3 × 5 × 7, highly composite number,[36] smallest number divisible by the numbers 1 to 8 (lowest common multiple of 1 to 8), sparsely totient number,[37] Harshad number in base 2 through base 10, idoneal number, balanced number,[38] sum of a twin prime (419 + 421). With 32 distinct divisors, it is the number below 1000 with the largest amount of divisors.
- 841 = 292 = 202 + 212, sum of three consecutive primes (277 + 281 + 283), sum of nine consecutive primes (73 + 79 + 83 + 89 + 97 + 101 + 103 + 107 + 109), centered square number,[39] centered heptagonal number,[40] centered octagonal number[41]
- 842 = 2 × 421, nontotient, 842!! - 1 is prime,[42] number of series-reduced trees with 18 nodes[43]
- 843 = 3 × 281, Lucas number[44]
- 844 = 22 × 211, nontotient, smallest 5 consecutive integers which are not squarefree are: 844 = 22 × 211, 845 = 5 × 132, 846 = 2 × 32 × 47, 847 = 7 × 112 and 848 = 24 × 53 [45]
- 845 = 5 × 132, concentric pentagonal number,[46] number of emergent parts in all partitions of 22 [47]
- 846 = 2 × 32 × 47, sum of eight consecutive primes (89 + 97 + 101 + 103 + 107 + 109 + 113 + 127), nontotient, Harshad number
- 847 = 7 × 112, happy number, number of partitions of 29 that do not contain 1 as a part[48]
- 848 = 24 × 53, untouchable number
- 849 = 3 × 283, the Mertens function of 849 returns 0, Blum integer
850s
[edit]- 850 = 2 × 52 × 17, the Mertens function of 850 returns 0, nontotient, the sum of the squares of the divisors of 26 is 850 (sequence A001157 in the OEIS). The maximum possible Fair Isaac credit score, country calling code for North Korea
- 851 = 23 × 37, number of compositions of 18 into distinct parts[49]
- 852 = 22 × 3 × 71, pentagonal number,[50] Smith number[24]
- country calling code for Hong Kong
- 853 = prime number, Perrin number,[51] the Mertens function of 853 returns 0, average of first 853 prime numbers is an integer (sequence A045345 in the OEIS), strictly non-palindromic number, number of connected graphs with 7 nodes
- country calling code for Macau
- 854 = 2 × 7 × 61, sphenic number, nontotient, number of unlabeled planar trees with 11 nodes[52]
- 855 = 32 × 5 × 19, decagonal number,[53] centered cube number[54]
- country calling code for Cambodia
- 856 = 23 × 107, nonagonal number,[55] centered pentagonal number,[56] refactorable number
- country calling code for Laos
- 857 = prime number, sum of three consecutive primes (281 + 283 + 293), Chen prime, Eisenstein prime with no imaginary part
- 858 = 2 × 3 × 11 × 13, Giuga number[57]
- 859 = prime number, number of planar partitions of 11,[58] prime index prime
860s
[edit]- 860 = 22 × 5 × 43, sum of four consecutive primes (199 + 211 + 223 + 227), Hoax number[59]
- 861 = 3 × 7 × 41, sphenic number, 41st triangular number,[22] hexagonal number,[60] Smith number[24]
- 862 = 2 × 431, lazy caterer number (sequence A000124 in the OEIS)
- 863 = prime number, safe prime,[34] sum of five consecutive primes (163 + 167 + 173 + 179 + 181), sum of seven consecutive primes (107 + 109 + 113 + 127 + 131 + 137 + 139), Chen prime, Eisenstein prime with no imaginary part, index of prime Lucas number[61]
- 864 = 25 × 33, Achilles number, sum of a twin prime (431 + 433), sum of six consecutive primes (131 + 137 + 139 + 149 + 151 + 157), Harshad number
- 865 = 5 × 173
- 866 = 2 × 433, nontotient, number of one-sided noniamonds,[62] number of cubes of edge length 1 required to make a hollow cube of edge length 13
- 867 = 3 × 172, number of 5-chromatic simple graphs on 8 nodes[63]
- 868 = 22 × 7 × 31 = J3(10),[64] nontotient
- 869 = 11 × 79, the Mertens function of 869 returns 0
870s
[edit]- 870 = 2 × 3 × 5 × 29, sum of ten consecutive primes (67 + 71 + 73 + 79 + 83 + 89 + 97 + 101 + 103 + 107), pronic number,[15] nontotient, sparsely totient number,[37] Harshad number
- This number is the magic constant of n×n normal magic square and n-queens problem for n = 12.
- 871 = 13 × 67, thirteenth tridecagonal number
- 872 = 23 × 109, refactorable number, nontotient, 872! + 1 is prime
- 873 = 32 × 97, sum of the first six factorials from 1
- 874 = 2 × 19 × 23, sphenic number, sum of the first twenty-three primes, sum of the first seven factorials from 0, nontotient, Harshad number, happy number
- 875 = 53 × 7, unique expression as difference of positive cubes:[65] 103 – 53
- 876 = 22 × 3 × 73, generalized pentagonal number[66]
- 877 = prime number, Bell number,[67] Chen prime, the Mertens function of 877 returns 0, strictly non-palindromic number,[26] prime index prime
- 878 = 2 × 439, nontotient, number of Pythagorean triples with hypotenuse < 1000.[68]
- 879 = 3 × 293, number of regular hypergraphs spanning 4 vertices,[69] candidate Lychrel seed number
880s
[edit]- 880 = 24 × 5 × 11 = 11!!!,[70] Harshad number; 148-gonal number; the number of n×n magic squares for n = 4.
- country calling code for Bangladesh
- 881 = prime number, twin prime, sum of nine consecutive primes (79 + 83 + 89 + 97 + 101 + 103 + 107 + 109 + 113), Chen prime, Eisenstein prime with no imaginary part, happy number
- 882 = 2 × 32 × 72 = a trinomial coefficient,[71] Harshad number, totient sum for first 53 integers, area of a square with diagonal 42[1]
- 883 = prime number, twin prime, lucky prime, sum of three consecutive primes (283 + 293 + 307), sum of eleven consecutive primes (59 + 61 + 67 + 71 + 73 + 79 + 83 + 89 + 97 + 101 + 103), the Mertens function of 883 returns 0
- 884 = 22 × 13 × 17, the Mertens function of 884 returns 0, number of points on surface of tetrahedron with sidelength 21[72]
- 885 = 3 × 5 × 59, sphenic number, number of series-reduced rooted trees whose leaves are integer partitions whose multiset union is an integer partition of 7.[73]
- 886 = 2 × 443, the Mertens function of 886 returns 0
- country calling code for Taiwan
- 887 = prime number followed by primal gap of 20, safe prime,[34] Chen prime, Eisenstein prime with no imaginary part
- 888 = 23 × 3 × 37, sum of eight consecutive primes (97 + 101 + 103 + 107 + 109 + 113 + 127 + 131), Harshad number, strobogrammatic number,[11] happy number, 888!! - 1 is prime[74]
- 889 = 7 × 127, the Mertens function of 889 returns 0
890s
[edit]- 890 = 2 × 5 × 89 = 192 + 232 (sum of squares of two successive primes),[75] sphenic number, sum of four consecutive primes (211 + 223 + 227 + 229), nontotient
- 891 = 34 × 11, sum of five consecutive primes (167 + 173 + 179 + 181 + 191), octahedral number
- 892 = 22 × 223, nontotient, number of regions formed by drawing the line segments connecting any two perimeter points of a 6 times 2 grid of squares like this (sequence A331452 in the OEIS).
- 893 = 19 × 47, the Mertens function of 893 returns 0
- 894 = 2 × 3 × 149, sphenic number, nontotient
- 895 = 5 × 179, Smith number,[24] Woodall number,[76] the Mertens function of 895 returns 0
- 896 = 27 × 7, refactorable number, sum of six consecutive primes (137 + 139 + 149 + 151 + 157 + 163), the Mertens function of 896 returns 0
- 897 = 3 × 13 × 23, sphenic number, Cullen number (sequence A002064 in the OEIS)
- 898 = 2 × 449, the Mertens function of 898 returns 0, nontotient
- 899 = 29 × 31 (a twin prime product),[77] happy number, smallest number with digit sum 26,[78] number of partitions of 51 into prime parts
References
[edit]- ^ a b Sloane, N. J. A. (ed.). "Sequence A001105 (a(n) = 2*n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ (sequence A229093 in the OEIS)
- ^ (sequence A005893 in the OEIS)
- ^ Sloane, N. J. A. (ed.). "Sequence A003107 (Number of partitions of n into Fibonacci parts (with a single type of 1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-25.
- ^ Sloane, N. J. A. (ed.). "Sequence A174457 (Infinitely refactorable numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-16.
- ^ "Richmond is getting a new area code. Not everyone is thrilled: 'I'll be 804 forever'". WTVR-TV. Retrieved 2025-03-16.
- ^ Karri Peifer. "The 804 is running out of numbers". AXIOS Richmond. Retrieved 2025-03-16.
- ^ Sloane, N. J. A. (ed.). "Sequence A002095 (Number of partitions of n into nonprime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-25.
- ^ Sloane, N. J. A. (ed.). "Sequence A002088 (Sum of totient function: a(n) = Sum_{k=1..n} phi(k), cf. A000010)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-25.
- ^ Sloane, N. J. A. (ed.). "Sequence A024816 (Antisigma(n): Sum of the numbers less than n that do not divide n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-25.
- ^ a b c Sloane, N. J. A. (ed.). "Sequence A000787 (Strobogrammatic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A005384 (Sophie Germain primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A154638 (a(n) is the number of distinct reduced words of length n in the Coxeter group of "Apollonian reflections" in three dimensions)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-25.
- ^ Sloane, N. J. A. (ed.). "Sequence A065577 (Number of Goldbach partitions of 10^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-08-31.
- ^ a b Sloane, N. J. A. (ed.). "Sequence A002378 (Oblong (or promic, pronic, or heteromecic) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ 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.
- ^ Sloane, N. J. A. (ed.). "Sequence A049312 (Number of graphs with a distinguished bipartite block, by number of vertices)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-25.
- ^ Sloane, N. J. A. (ed.). "Sequence A000292 (Tetrahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A000931 (Padovan sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A003215 (Hex (or centered hexagonal) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A000330 (Square pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ a b Sloane, N. J. A. (ed.). "Sequence A000217 (Triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A005282 (Mian-Chowla sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ a b c d Sloane, N. J. A. (ed.). "Sequence A006753 (Smith numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A098859 (Number of partitions of n into parts each of which is used a different number of times)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-25.
- ^ a b Sloane, N. J. A. (ed.). "Sequence A016038 (Strictly non-palindromic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ (sequence A045943 in the OEIS)
- ^ Sloane, N. J. A. (ed.). "Sequence A001401 (Number of partitions of n into at most 5 parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-25.
- ^ (sequence A085449 in the OEIS)
- ^ 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. Retrieved 2022-06-02.
- ^ Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A085787 (Generalized heptagonal numbers: m*(5*m – 3)/2, m = 0, +-1, +-2 +-3, ...)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-30.
- ^ Sloane, N. J. A. (ed.). "Sequence A027430 (Number of distinct products ijk with 1 <= i<j<k <= n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ a b c Sloane, N. J. A. (ed.). "Sequence A005385 (Safe primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A100827 (Highly cototient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A002182 (Highly composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ a b Sloane, N. J. A. (ed.). "Sequence A036913 (Sparsely totient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ 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.
- ^ Sloane, N. J. A. (ed.). "Sequence A001844 (Centered square numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A069099 (Centered heptagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ 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. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A007749 (Numbers k such that k!! - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
- ^ 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 A000032 (Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A045882 (Smallest term of first run of (at least) n consecutive integers which are not squarefree)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
- ^ Sloane, N. J. A. (ed.). "Sequence A032527 (Concentric pentagonal numbers: floor( 5*n^2 / 4 ))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
- ^ Sloane, N. J. A. (ed.). "Sequence A182699 (Number of emergent parts in all partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
- ^ 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. Retrieved 2022-05-24.
- ^ 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. Retrieved 2022-05-24.
- ^ Sloane, N. J. A. (ed.). "Sequence A000326 (Pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A001608 (Perrin sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A002995 (Number of unlabeled planar trees (also called plane trees) with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
- ^ Sloane, N. J. A. (ed.). "Sequence A001107 (10-gonal (or decagonal) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A005898 (Centered cube numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A001106 (9-gonal (or enneagonal or nonagonal) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A005891 (Centered pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A007850 (Giuga numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A000219 (Number of planar partitions (or plane partitions) of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
- ^ Sloane, N. J. A. (ed.). "Sequence A019506 (Hoax numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
- ^ Sloane, N. J. A. (ed.). "Sequence A000384 (Hexagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A001606 (Indices of prime Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A006534". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-10.
- ^ Sloane, N. J. A. (ed.). "Sequence A076281 (Number of 5-chromatic (i.e., chromatic number equals 5) simple graphs on n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
- ^ Sloane, N. J. A. (ed.). "Sequence A059376 (Jordan function J_3(n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
- ^ Sloane, N. J. A. (ed.). "Sequence A014439 (Differences between two positive cubes in exactly 1 way.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2019-08-18.
- ^ Sloane, N. J. A. (ed.). "Sequence A001318 (Generalized pentagonal numbers.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2019-08-26.
- ^ Sloane, N. J. A. (ed.). "Sequence A000110 (Bell or exponential numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A101929 (Number of Pythagorean triples with hypotenuse < 10^n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A319190 (Number of regular hypergraphs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2019-08-18.
- ^ Sloane, N. J. A. (ed.). "Sequence A007661 (Triple factorial numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A111808 (Left half of trinomial triangle (A027907), triangle read by rows)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A005893 (Number of points on surface of tetrahedron)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A319312 (Number of series-reduced rooted trees whose leaves are integer partitions whose multiset union is an integer partition of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A007749 (Numbers k such that k!! - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
- ^ Sloane, N. J. A. (ed.). "Sequence A069484 (a(n) = prime(n+1)^2 + prime(n)^2.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A003261 (Woodall numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A037074 (Numbers that are the product of a pair of twin primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-11.
- ^ Sloane, N. J. A. (ed.). "Sequence A051885 (Smallest number whose sum of digits is n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-11.
800 (number)
View on Grokipediafrom Grokipedia
Mathematical Properties
Definition and Basic Characteristics
800 (eight hundred) is the natural number following 799 and preceding 801 in the sequence of positive integers. As an even integer, it is divisible by 2, and in the decimal numeral system, it is classified as a three-digit number, ranging from 100 to 999. The standard English cardinal name for 800 is "eight hundred," while its ordinal form is "eight hundredth" or abbreviated as "800th." One notable mathematical representation of 800 involves sums of prime numbers. Specifically, 800 equals the sum of the four consecutive primes 193, 197, 199, and 211:This property highlights 800's connection to prime number sequences.[10] In geometry, 800 serves as the area of a square whose diagonal measures 40 units. The formula for the area of a square with diagonal length is
yielding
This follows from the relationship where the diagonal for side length , so .[11]
Factorization and Divisors
The prime factorization of 800 is .[12] This factorization yields the complete set of positive divisors of 800, which are: 1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 40, 50, 80, 100, 160, 200, 400, and 800.[13] The total number of divisors is 18, derived from the prime factorization using the divisor function , where are the exponents in the prime factorization; thus, .[14]Special Classifications and Representations
800 is classified as a Harshad number (also known as a Niven number) because it is divisible by the sum of its digits: 8 + 0 + 0 = 8, and 800 ÷ 8 = 100.[15] It is also an Achilles number, defined as a powerful number where each prime factor in its prime factorization has an exponent of at least 2, but which is not a perfect power; here, 800 = 2^5 × 5^2 satisfies the condition since the exponents 5 and 2 are both ≥2 and their greatest common divisor is 1.[16] In the context of integer sequences, 800 appears as the 20th term (a(20)) in OEIS A001105, the sequence of double squares given by a(n) = 2n^2 for n ≥ 1.[17] Geometrically, this relates to the area of a square with an even integer diagonal length of 40, as the area equals (diagonal)^2 / 2 = 1600 / 2 = 800.[17]Numeral Systems
Ancient and Classical Numerals
In the Roman numeral system, 800 is represented as DCCC, combining the symbol D for 500 with three instances of C for 100 each, totaling 300 through additive repetition.[18][19] This notation exemplifies the system's reliance on additive principles for values without direct subtractive equivalents, as Roman numerals primarily use subtraction only for specific pairs like IV (4), IX (9), XL (40), XC (90), CD (400), and CM (900) to avoid excessive repetition.[20] However, the subtractive principle has limitations, such as prohibiting more than one subtractive symbol per instance or subtracting beyond a power of ten, which for larger numbers like 800 results in purely additive forms that can become cumbersome and lengthy, as seen in the need for three Cs rather than a more compact alternative.[21][22] The Greek numeral system, or Ionic numerals, assigns values to letters of the alphabet, with 800 denoted by Ωʹ, where Ω (omega) represents 800 and the prime accent (keraia) indicates its numeric use.[23] This alphabetic system, developed around the 4th century BCE, operates additively like Roman numerals but covers higher values through the full Greek alphabet, avoiding the repetition issues of earlier acrophonic systems. In Hebrew numerals, based on gematria where letters correspond to numbers, 800 is often written as תת, by repeating the letter ת (tav, valued at 400) additively, or alternatively as ף, the final form of פ (peh), which in extended gematria systems carries the value 800 for numbers beyond the standard alphabet range up to 400.[24][25] This dual representation reflects the system's flexibility for larger quantities, using final letter forms (sofit) for 500–900 to extend the 22-letter alphabet without introducing new symbols.[25] Ancient Egyptian numerals employed a non-positional base-10 system of hieroglyphs, where 800 is depicted as 𓍩, consisting of eight repetitions of the coil symbol 𓆐 (representing 100) grouped additively. This hieroglyphic notation, used from around 3000 BCE, prioritized visual repetition over place value, making higher numbers like 800 straightforward but repetitive compared to later positional systems.[26] The Armenian numeral system, introduced in the 5th century CE, assigns numeric values to the letters of its alphabet, with 800 represented by the capital Պ (peh).[27] Like other alphabetic systems, it uses additive combination for compound numbers, drawing from earlier Greek influences but adapted to the unique Armenian script for practical use in manuscripts and inscriptions.[28]Modern Digital Representations
In contemporary computing and mathematics, the number 800 is represented using positional numeral systems that facilitate efficient storage, processing, and display in digital environments. The decimal (base-10) system, the standard for human-readable interfaces, denotes it simply as 800, leveraging digits 0 through 9 to express values up to for places.[29] Binary (base-2) representation, fundamental to computer hardware, expresses 800 as , spanning 10 bits where the value is calculated as . This form is used directly in machine instructions and memory addressing, though its length can hinder manual interpretation.[30] Octal (base-8) provides a grouped alternative, writing 800 as , equivalent to . Historically tied to early computing architectures like those grouping bits into threes, it offers moderate compactness over binary.[31] Hexadecimal (base-16) further optimizes representation as , computed as . In programming, this is efficient for values like 800 because each hex digit encodes four binary digits (a nibble), enabling concise notation—reducing 10 binary bits to three hex digits—while allowing rapid conversion to binary for CPU operations and improving code readability in contexts such as memory dumps or color codes.[32][33][34] These modern systems evolved from non-positional precursors, such as the Roman numeral DCCC for 800, by introducing place value for scalable computation.[1]Applications in Science and Technology
Measurements and Units
In measurements and units, the number 800 frequently appears in conversions across length, mass, volume, and sensitivity scales, providing practical benchmarks in physics, photography, and everyday applications. For length, 800 meters is equivalent to approximately 0.497 miles or 874.89 yards, using the standard conversion factors of 1 meter ≈ 0.000621371 miles and 1 meter ≈ 1.09361 yards, respectively.[35] This distance is notable as the standard for the 800 meters event in track and field athletics.[36] In photography, ISO 800 represents a film speed rating that indicates moderate sensitivity to light, doubling the sensitivity of ISO 400 film and allowing for faster shutter speeds or wider apertures in lower-light conditions without excessive underexposure.[37] This rating, part of the ISO standard for sensitometry, is particularly useful for indoor or overcast shooting, where it captures adequate exposure while introducing minimal grain compared to higher ISOs.[38] For mass, 800 grams converts to about 1.76 pounds, based on the factor 1 gram ≈ 0.00220462 pounds, making it a common portion size in food packaging and nutrition labeling.[39] Similarly, 800 kilograms equals 0.8 metric tons (tonnes), derived from 1 metric ton = 1000 kilograms, which serves as a reference in engineering and logistics for loads like small cargo shipments.[40] Regarding volume, 800 milliliters is approximately 27.05 US fluid ounces, calculated via 1 milliliter ≈ 0.033814 fluid ounces, and is a prevalent size in beverage packaging, such as water bottles and sports drinks that facilitate portable hydration.[41][42] The even composite nature of 800 aids its divisibility into subunits like 400 or 200, enhancing precision in such unit applications.Computing and Data
In binary representation, the decimal number 800 is expressed as 1100100000₂, requiring 10 bits for storage since 2⁹ = 512 < 800 < 1024 = 2¹⁰.[43][44] This bit length was typical for early digital systems handling values up to 1023, influencing the design of counters and registers in 1980s microprocessors. In data storage contexts, 800 bytes equates to approximately 0.781 kilobytes (using the binary convention where 1 KB = 1024 bytes), often rounded to 0.8 KB in practical discussions.[45] This unit scale appeared in early personal computing for file sizes and buffer allocations, such as in text documents or small programs on systems with limited RAM. Historically, 800 baud rates were employed in 1980s modems for serial data transmission over telephone lines, bridging slower 300 baud acoustic couplers and faster 1200 baud direct-connect models.[46] Devices like the Zoom 800 baud modem facilitated bulletin board system (BBS) access and early online services, achieving bit rates around 800 bits per second under ideal conditions. In low-level programming, 800 in decimal corresponds to the hexadecimal value 0x320, commonly used for memory offsets and addresses in assembly language or C code to reference locations in buffers or data structures.[47] This representation simplifies bitwise operations and debugging in environments like embedded systems or operating kernel development. The On-Line Encyclopedia of Integer Sequences (OEIS) catalogs numerous computational sequences involving 800, reflecting its role in algorithmic problems. For example, the lazy caterer's sequence (OEIS A000124), given by p(n) = n(n+1)/2 + 1, models the maximum number of pieces a circle can be divided into by n lines—a combinatorial problem central to computational geometry algorithms for graphics rendering, such as line clipping and region filling in 2D displays.[48] Such sequences inform efficient partitioning in computer graphics software, where values near 800 might parameterize complexity in rendering pipelines.Cultural and Historical Significance
Historical Events in Year 800
The year 800 marked a pivotal moment in medieval history, serving as a leap year in the Julian calendar with 366 days and beginning on a Wednesday.[49] Represented as DCCC in Roman numerals,[1] it witnessed transformative political, cultural, and military developments across Eurasia that reshaped empires and intellectual traditions. On December 25, 800, in Rome, Pope Leo III crowned Charlemagne, King of the Franks and Lombards, as Emperor of the Romans, an event that revived the imperial title in the West after centuries of dormancy following the fall of the Western Roman Empire.[50] This coronation, conducted during a Mass in St. Peter's Basilica, symbolized the alliance between the papacy and Frankish power, positioning Charlemagne as a protector of the Church and marking the foundation of what would become the Holy Roman Empire.[51] The act strained relations with the Byzantine Empire, which viewed it as an usurpation of imperial authority, yet it solidified Charlemagne's rule over a vast territory encompassing much of Western Europe.[52] Viking raids escalated in Europe around 800, signaling the onset of the Viking Age and disrupting coastal communities from Britain to the Continent.[53] Following initial attacks like the 793 sacking of Lindisfarne monastery, Scandinavian warriors intensified incursions into Frisia, Ireland, and England, driven by population pressures, trade opportunities, and advanced shipbuilding technology that enabled swift maritime assaults.[54] These raids, often targeting undefended monasteries and trade centers, contributed to widespread instability and prompted defensive fortifications across Europe.[53] In China, the Tang Dynasty grappled with mounting internal strife around 800, as the aftershocks of the An Lushan Rebellion (755–763) eroded central authority and fueled regional warlordism.[55] Eunuch dominance in the imperial court, coupled with the rise of semi-autonomous jiedushi military governors, exacerbated factional conflicts and peasant discontent, setting the stage for further rebellions like the Huang Chao uprising in the 870s.[56] This period of decline diminished Tang cultural and economic influence, hastening the dynasty's eventual fragmentation.[55]Telephone and Communication Systems
In the North American Numbering Plan (NANP), the prefix 800 serves as the original toll-free telephone number code, formatted as 1-800-xxx-xxxx, where the recipient of the call bears the cost rather than the caller.[57] Introduced in 1967 by AT&T under the service known as INWATS (Inward Wide Area Telephone Service), it was initially designed to enable businesses to offer free calling to customers for customer service and marketing purposes.[58] By the mid-1990s, the supply of available 800 numbers had been exhausted after nearly 30 years of use, prompting the Federal Communications Commission (FCC) to introduce additional toll-free prefixes to meet growing demand.[59] The expansion began with the 888 prefix in 1996, followed by 877 in 1998 and 866 in 1999, with further codes such as 855 (2010), 844 (2013), and 833 (2017) added sequentially as prior codes approached depletion.[58] A key milestone in the evolution of these services occurred in 1993, when the FCC deregulated the market through an order that ended AT&T's monopoly, allowing customers to port their toll-free numbers to competing carriers and enabling multiple Responsible Organizations (Resp Orgs) to administer assignments.[60] This shift fostered competition, increased availability, and spurred innovations like vanity numbers, which map letters to digits on phone keypads for memorable branding; a prominent example is 1-800-FLOWERS, used by the floral delivery company since the 1980s to leverage the prefix's recognition.[61] Internationally, the International Telecommunication Union (ITU) designates +800 as the country code for the Universal International Freephone Number (UIFN), an 11-digit format consisting of the +800 prefix followed by an 8-digit Global Subscriber Number (GSN), enabling toll-free access from participating countries worldwide.[62] In Europe, the 0800 prefix is widely used for national freephone services across many countries, such as the United Kingdom where calls to 0800 and 0808 numbers are free from landlines and mobiles.[63] The number 800's composite nature, as a multiple of 100, facilitates its repeated use in scalable numbering schemes like these without structural conflicts.[59]Sports and Athletics
The 800 metres is a prominent middle-distance running event in track and field athletics, renowned for blending sprint speed with endurance demands.[36] Runners complete two laps on a standard 400-metre oval track, starting from staggered positions to account for the curve, which tests both anaerobic and aerobic capacities over approximately 1 minute and 45 seconds for elite athletes.[36] The event requires precise pacing, as runners must accelerate early to secure optimal positioning while conserving energy for a powerful finish, making it a staple in major competitions.[64] Introduced as an Olympic event in 1896 at the first modern Summer Games in Athens, the men's 800 metres has been contested continuously thereafter, with Edwin Flack of Australia winning the inaugural gold in 2:11.0.[65] The women's 800 metres debuted in 1928 but was controversially removed after one edition before returning permanently in 1960, reflecting evolving gender inclusion in athletics.[36] Its tactical nature—often described as a "tactical race"—stems from strategic positioning, where athletes jostle for inside lanes during the first lap and break for the final straight around the 600-metre mark to avoid being boxed in.[64] Elite competitors typically run the first 400 metres at 90-93% of their maximum 400-metre pace before surging, emphasizing mental fortitude and race-reading skills over raw speed alone.[66] World records underscore the event's evolution and intensity. The men's mark stands at 1:40.91, set by Kenya's David Rudisha during the 2012 London Olympics final, where he led wire-to-wire in a display of front-running dominance that remains unbroken as of 2025. In the women's category, Czechoslovakia's Jarmila Kratochvílová established the current record of 1:53.28 on July 26, 1983, at the Olympic Stadium in Munich, a mark that has endured for over four decades despite scrutiny over the era's doping practices.[67] Variations of the 800 metres adapt to different formats while preserving its core challenges. The indoor version, run on a 200-metre banked track for two laps, features in World Athletics Indoor Championships and national meets, with tighter curves demanding enhanced cornering technique and quicker recovery. Additionally, the 800 metres serves as the culminating event in the women's heptathlon, where it contributes significantly to overall scoring—athletes earn points based on performance tables, with a standard time around 2:10 yielding about 1,000 points—and tests multi-event specialists' fatigue management after six prior disciplines.[68] The 800 metres has held historical prominence in global championships, including the biennial World Athletics Championships since their inception in 1983, where it routinely produces dramatic finishes and record-breaking depth. For instance, at the 2025 Tokyo edition, Kenya's Emmanuel Wanyonyi claimed gold in a championship-record 1:41.86, edging out rivals in a photo-finish that highlighted the event's competitive evolution.[69] Its inclusion across Olympic, world, and regional levels has elevated it as a showcase for tactical mastery and international rivalries in middle-distance running.[70]References
- https://en.wiktionary.org/wiki/%25D5%258A
