Base | Representation |
---|---|
bin | 1001000110001001000000… |
… | …1000011111011010001111 |
3 | 1022102002120222212011100112 |
4 | 2101202100020133122033 |
5 | 2302324224103304444 |
6 | 33134235352550235 |
7 | 2051361426311402 |
oct | 221422010373217 |
9 | 38362528764315 |
10 | 10001102009999 |
11 | 32064973a1491 |
12 | 11563449b237b |
13 | 57713b561049 |
14 | 2680ad631d39 |
15 | 125241a7469e |
hex | 9189021f68f |
10001102009999 has 2 divisors, whose sum is σ = 10001102010000. Its totient is φ = 10001102009998.
The previous prime is 10001102009993. The next prime is 10001102010013. The reversal of 10001102009999 is 99990020110001.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10001102009999 - 212 = 10001102005903 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10001102009993) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000551004999 + 5000551005000.
It is an arithmetic number, because the mean of its divisors is an integer number (5000551005000).
Almost surely, 210001102009999 is an apocalyptic number.
10001102009999 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001102009999 is an equidigital number, since it uses as much as digits as its factorization.
10001102009999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13122, while the sum is 41.
The spelling of 10001102009999 in words is "ten trillion, one billion, one hundred two million, nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •