Base | Representation |
---|---|
bin | 1001000110001100110000… |
… | …1110000011100111001111 |
3 | 1022102012012020202112120002 |
4 | 2101203030032003213033 |
5 | 2302333310141230332 |
6 | 33134523403514515 |
7 | 2051425420044134 |
oct | 221431416034717 |
9 | 38365166675502 |
10 | 10002110101967 |
11 | 3206964441945 |
12 | 1156586528a3b |
13 | 57726c372479 |
14 | 26816748858b |
15 | 1252a0303562 |
hex | 918cc3839cf |
10002110101967 has 2 divisors, whose sum is σ = 10002110101968. Its totient is φ = 10002110101966.
The previous prime is 10002110101927. The next prime is 10002110102077. The reversal of 10002110101967 is 76910101120001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10002110101967 - 216 = 10002110036431 is a prime.
It is a super-2 number, since 2×100021101019672 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10002110101927) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5001055050983 + 5001055050984.
It is an arithmetic number, because the mean of its divisors is an integer number (5001055050984).
Almost surely, 210002110101967 is an apocalyptic number.
10002110101967 is a deficient number, since it is larger than the sum of its proper divisors (1).
10002110101967 is an equidigital number, since it uses as much as digits as its factorization.
10002110101967 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 29.
Adding to 10002110101967 its reverse (76910101120001), we get a palindrome (86912211221968).
The spelling of 10002110101967 in words is "ten trillion, two billion, one hundred ten million, one hundred one thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •