Base | Representation |
---|---|
bin | 1001000110110001111111… |
… | …0010001010100011011101 |
3 | 1022110010222121022010002202 |
4 | 2101230133302022203131 |
5 | 2303014241103323401 |
6 | 33143255101101245 |
7 | 2052231135630431 |
oct | 221543762124335 |
9 | 38403877263082 |
10 | 10012102011101 |
11 | 3210121630093 |
12 | 11584b4857825 |
13 | 5781a2489038 |
14 | 2688345029c1 |
15 | 12568761406b |
hex | 91b1fc8a8dd |
10012102011101 has 2 divisors, whose sum is σ = 10012102011102. Its totient is φ = 10012102011100.
The previous prime is 10012102011077. The next prime is 10012102011143. The reversal of 10012102011101 is 10111020121001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8974757724100 + 1037344287001 = 2995790^2 + 1018501^2 .
It is a cyclic number.
It is not a de Polignac number, because 10012102011101 - 222 = 10012097816797 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10012102017101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5006051005550 + 5006051005551.
It is an arithmetic number, because the mean of its divisors is an integer number (5006051005551).
Almost surely, 210012102011101 is an apocalyptic number.
It is an amenable number.
10012102011101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10012102011101 is an equidigital number, since it uses as much as digits as its factorization.
10012102011101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10012102011101 its reverse (10111020121001), we get a palindrome (20123122132102).
The spelling of 10012102011101 in words is "ten trillion, twelve billion, one hundred two million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •