This site is supported by donations to The OEIS Foundation.
10
Since we have ten fingers, which are convenient for counting, 10 is the base of our numeral system. At various times in our history, 5 (five fingers), 12 (first abundant number), 20 (perhaps for fingers and toes) and 60 (an abundant number) were contenders for the base of numeration, but in the end, the decimal numeral system won out. Almost all computers carry out their computations in binary, but the vast majority of the time they take input and give output in decimal.
Contents
- 1 Membership in core sequences
- 2 Core sequences modulo 10
- 3 Sequences pertaining to 10
- 4 Partitions of 10
- 5 Roots and powers of 10
- 6 Logarithms and tenth powers
- 7 Values for number theoretic functions with 10 as an argument
- 8 Factorization of 10 in some quadratic integer rings
- 9 Factorization of some small integers in a quadratic integer ring adjoining the square roots of −10, 10
- 10 Representation of 10 in various bases
- 11 References
- 12 See also
Membership in core sequences
Even numbers | 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, ... | A005843(5) |
Composite numbers | 4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, ... | A002808(5) |
Semiprimes | 4, 6, 9, 10, 14, 15, 21, 22, 25, 26, 33, ... | A001358(4) |
Squarefree numbers | 1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, ... | A005117(7) |
Triangular numbers | 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 66, ... | A000217(4) |
In Pascal's triangle, 10 occurs four times: firstly the two binomial coefficients in the middle of row 5
and secondly twice in row 10, in the second and next to last positions
Core sequences modulo 10
Given that 10 is the base of our preferred numeral system, it is only natural that the OEIS has entries for several core sequences modulo 10.
Integers modulo 10 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, ... | A010879 |
Prime numbers modulo 10 | 2, 3, 5, 7, 1, 3, 7, 9, 3, 9, 1, 7, 1, 3, 7, 3, 9, 1, 7, 1, 3, 9, 3, 9, ... | A007652 |
Fibonacci numbers modulo 10 | 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7, 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, ... | A003893 |
Squares modulo 10 | 1, 4, 9, 6, 5, 6, 9, 4, 1, 0, 1, 4, 9, 6, 5, 6, 9, 4, 1, 0, 1, 4, 9, 6, ... | A008959 |
Powers of 2 modulo 10 | 1, 2, 4, 8, 6, 2, 4, 8, 6, 2, 4, 8, 6, 2, 4, 8, 6, 2, 4, 8, 6, 2, 4, 8, ... | A000689 |
Sequences pertaining to 10
Multiples of 10 | 0, 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 110, 120, ... | A008592 |
Decagonal numbers | 1, 10, 27, 52, 85, 126, 175, 232, 297, 370, 451, 540, ... | A001107 |
Decagonal pyramidal numbers | 1, 11, 38, 90, 175, 301, 476, 708, 1005, 1375, 1826, ... | A007585 |
sequence beginning at 3 | 3, 10, 5, 16, 8, 4, 2, 1, 4, 2, 1, 4, 2, 1, 4, 2, 1, 4, 2, ... | A033478 |
sequence beginning at 36 | 36, 18, 9, 26, 13, 38, 19, 56, 28, 14, 7, 20, 10, 5, 14, ... | A008894 |
Partitions of 10
There are forty-two[1] partitions of 10.
The numbers of partitions of 10 with largest part {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} are respectively {1, 5, 8, 9, 7, 5, 3, 2, 1, 1}. (There are 20 partitions of 10 with largest part odd and 22 partitions of 10 with largest part even.)
The numbers of partitions of 10 with number of parts {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} are respectively {1, 5, 8, 9, 7, 5, 3, 2, 1, 1}. (There are 20 partitions of 10 into an odd number of parts and 22 partitions of 10 into an even number of parts.)
The four partitions of 10 into equal parts (factorization partitions) are
- {1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, {2, 2, 2, 2, 2} , {5, 5} and {10}.
The ten partitions of 10 into distinct parts are
- {4, 3, 2, 1}, {5, 3, 2}, {5, 4, 1}, {6, 3, 1}, {6, 4}, {7, 2, 1}, {7, 3}, {8, 2}, {9, 1}, {10},
where {4, 3, 2, 1} is a triangular partition.
The seven partitions of 10 into even parts are
- {2, 2, 2, 2, 2}, {4, 2, 2, 2}, {4, 4, 2}, {6, 2, 2}, {6, 4}, {8, 2}, {10}.
The ten partitions of 10 into odd parts are
- {1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, {3, 1, 1, 1, 1, 1, 1, 1}, {3, 3, 1, 1, 1, 1}, {3, 3, 3, 1}, {5, 1, 1, 1, 1, 1}, {5, 3, 1, 1}, {5, 5}, {7, 1, 1, 1}, {7, 3}, {9, 1}.
The five partitions of 10 into prime parts are
- {2, 2, 2, 2, 2}, {3, 3, 2, 2}, {5, 3, 2}, {5, 5} and {7, 3},
where {5, 5} and {7, 3} are Goldbach partitions of 10.
The two partitions of 10 into distinct prime parts are
- {5, 3, 2} and {7, 3}.
The four partitions of 10 into square parts are
- {1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, {4, 1, 1, 1, 1, 1, 1}, {4, 4, 1, 1} and {9, 1},
where {4, 4, 1, 1} is a "sum of four squares" partition of 10.
Ordinal | Partition | Equal parts |
Distinct parts |
Even parts |
Odd parts |
Prime parts |
Number of parts |
---|---|---|---|---|---|---|---|
1 | {1, 1, 1, 1, 1, 1, 1, 1, 1, 1} | 10 | |||||
2 | {2, 1, 1, 1, 1, 1, 1, 1, 1} | 9 | |||||
3 | {2, 2, 1, 1, 1, 1, 1, 1} | 8 | |||||
4 | {2, 2, 2, 1, 1, 1, 1} | 7 | |||||
5 | {2, 2, 2, 2, 1, 1} | 6 | |||||
6 | {2, 2, 2, 2, 2} | 5 | |||||
7 | {3, 1, 1, 1, 1, 1, 1, 1} | 8 | |||||
8 | {3, 2, 1, 1, 1, 1, 1} | 7 | |||||
9 | {3, 2, 2, 1, 1, 1} | 6 | |||||
10 | {3, 2, 2, 2, 1} | 5 | |||||
11 | {3, 3, 1, 1, 1, 1} | 6 | |||||
12 | {3, 3, 2, 1, 1} | 5 | |||||
13 | {3, 3, 2, 2} | 4 | |||||
14 | {3, 3, 3, 1} | 4 | |||||
15 | {4, 1, 1, 1, 1, 1, 1} | 7 | |||||
16 | {4, 2, 1, 1, 1, 1} | 6 | |||||
17 | {4, 2, 2, 1, 1} | 5 | |||||
18 | {4, 2, 2, 2} | 4 | |||||
19 | {4, 3, 1, 1, 1} | 5 | |||||
20 | {4, 3, 2, 1} | 4 | |||||
21 | {4, 3, 3} | 3 | |||||
22 | {4, 4, 1, 1} | 4 | |||||
23 | {4, 4, 2} | 3 | |||||
24 | {5, 1, 1, 1, 1, 1} | 6 | |||||
25 | {5, 2, 1, 1, 1} | 5 | |||||
26 | {5, 2, 2, 1} | 4 | |||||
27 | {5, 3, 1, 1} | 4 | |||||
28 | {5, 3, 2} | 3 | |||||
29 | {5, 4, 1} | 3 | |||||
30 | {5, 5} | 2 | |||||
31 | {6, 1, 1, 1, 1} | 5 | |||||
32 | {6, 2, 1, 1} | 4 | |||||
33 | {6, 2, 2} | 3 | |||||
34 | {6, 3, 1} | 3 | |||||
35 | {6, 4} | 2 | |||||
36 | {7, 1, 1, 1} | 4 | |||||
37 | {7, 2, 1} | 3 | |||||
38 | {7, 3} | 2 | |||||
39 | {8, 1, 1} | 3 | |||||
40 | {8, 2} | 2 | |||||
41 | {9, 1} | 2 | |||||
42 | {10} | 1 |
Roots and powers of 10
In the following tables, irrational numbers are given truncated to eight decimal places.
|
|
Logarithms and tenth powers
In the OEIS specifically and mathematics in general, refers to the natural logarithm of , whereas all other bases are specified with a subscript. But in many contexts, base 10 logarithms (common logarithms) are meant when there is no subscript.
As above, irrational numbers in the following tables are truncated to eight decimal places.
0.30102999 | A007524 | 3.32192809 | A020862 | 2 10 | 1024 | |||
0.43429448 | A002285 | 2.30258509 | A002392 | 22026.46579480 | ||||
0.47712125 | A114490 | 2.09590327 | A152566 | 3 10 | 59049 | |||
0.49714987 | A053511 | 2.01146586 | A235955 | 93648.04747608 | ||||
0.60205999 | A114493 | 1.66096404 | A154155 | 4 10 | 1048576 | |||
0.69897000 | A153268 | 1.43067655 | A154156 | 5 10 | 9765625 | |||
0.77815125 | A153496 | 1.28509720 | A154157 | 6 10 | 60466176 | |||
0.84509804 | A153620 | 1.18329466 | A154158 | 7 10 | 282475249 | |||
0.90308998 | A153790 | 1.10730936 | A154159 | 8 10 | 1073741824 | |||
0.95424250 | A104139 | 1.04795163 | A154160 | 9 10 | 3486784401 | |||
1.00000000 | 10 10 | 10000000000 |
(See A008454 for the tenth powers of integers).
It follows from Fermat's little theorem that if an integer is not a multiple of 11, then is.
Values for number theoretic functions with 10 as an argument
1 | ||
–1 | ||
4 | ||
18 | ||
4 | ||
4 | ||
2 | ||
2 | ||
4 | This is the Carmichael lambda function. | |
1 | This is the Liouville lambda function. | |
1.0009945751278180853371459589... (see A013668). | ||
10! | 3628800 | |
362880 |
Factorization of 10 in some quadratic integer rings
In , 10 has the prime factorization of 2 × 5. But it has different factorizations in some quadratic integer rings.
2 × 5 | 2 × 5 | ||
2 × 5 | |||
2 × 5 OR | 2 × 5 OR | ||
2 × 5 | |||
2 × 5 | |||
2 × 5 OR | |||
Note that is not a distinct factorization because both and are divisible by and .
Nor is is a distinct factorization as the latter two factors are both reducible.
Factorization of some small integers in a quadratic integer ring adjoining the square roots of −10, 10
The commutative quadratic integer ring with unity , with units of the form (), is not a unique factorization domain, having class number 2. If an odd prime is of the form , it is composite in (see A141180).
is not a unique factorization domain either, also having class number 2. But in it, there are only two units: 1 and –1. Therefore, we can say with much greater confidence that we have correctly identified instances of multiple factorization. But rather than "prime" we will use the term "irreducible" for those primes which are not composite in these domains.[2]
2 | Irreducible | Irreducible |
3 | Prime | |
4 | 2 2 | |
5 | Irreducible | |
6 | 2 × 3 | 2 × 3 OR |
7 | Irreducible | Prime |
8 | 2 3 | |
9 | 3 2 | 3 2 OR |
10 | 2 × 5 OR | 2 × 5 OR |
11 | Prime | |
12 | 2 2 × 3 | |
13 | Irreducible | |
14 | 2 × 7 OR | |
15 | 3 × 5 | 3 × 5 OR |
16 | 2 4 | 2 4 |
17 | Prime | |
18 | 2 × 3 2 | 2 × 3 2 OR |
19 | Prime | |
20 | 2 2 × 5 OR | 2 2 × 5 OR |
Note that is not a distinct factorization of 4, as it is readily obtained by multiplying 2 by . Nor is a distinct factorization of 6 because . That is not a distinct factorization of 10 should become obvious upon comparison to the fundamental unit. Similarly for 16, is not a distinct factorization because it can be obtained by twice doubling the fundamental unit.
Ideals really help us make sense of multiple distinct factorizations in these domains.
Factorization of | ||
In | In | |
2 | ||
3 | Prime | |
5 | ||
7 | Prime | |
11 | ||
13 | ||
17 | Prime | |
19 | Prime | |
23 | ||
29 | Prime | |
31 | ||
37 | ||
41 | ||
43 | Prime | |
47 | Prime |
Representation of 10 in various bases
Base | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 through 36 |
Representation | 1010 | 101 | 22 | 20 | 14 | 13 | 12 | 11 | 10 | A |
For bases 37 and higher, we could theoretically just keep adding symbols. At least one base converter available online[3] adds the lowercase letters a to z in order to accomplish conversion to bases 37 through 62. Thus, a is 36 in base 37, but A is still A in base 37.
In the balanced ternary numeral system, 10 is {1, 0, 1}, meaning (it has the same representation in the "normal" ternary system). In negabinary, 10 is 11110, since . In quater-imaginary base, 10 is 10202. In the factorial numeral system, 10 is 120, since .
References
- ↑ A000041(10)
- ↑ See irreducible elements for an explanation of these terminologies.
- ↑ http://convertxy.com/index.php/numberbases/
See also
- 10-gonal numbers (decagonal numbers)
0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 |
20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 |
30 | 31 | 32 | 33 | 34 | 35 | 36 | 37 | 38 | 39 |
40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | 49 |
1729 |