Base | Representation |
---|---|
bin | 1001000110001000101101… |
… | …0000000111000000010111 |
3 | 1022102002101021202202220202 |
4 | 2101202023100013000113 |
5 | 2302324042122333421 |
6 | 33134223305451115 |
7 | 2051356413260315 |
oct | 221421320070027 |
9 | 38362337682822 |
10 | 10001020121111 |
11 | 3206455150118 |
12 | 11563214a0a9b |
13 | 5771275bbc96 |
14 | 2680a27d70b5 |
15 | 12523979b10b |
hex | 9188b407017 |
10001020121111 has 2 divisors, whose sum is σ = 10001020121112. Its totient is φ = 10001020121110.
The previous prime is 10001020121093. The next prime is 10001020121137. The reversal of 10001020121111 is 11112102010001.
It is a weak prime.
It is an emirp because it is prime and its reverse (11112102010001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10001020121111 - 230 = 9999946379287 is a prime.
It is a super-2 number, since 2×100010201211112 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10001020121092 and 10001020121101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10001020123111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000510060555 + 5000510060556.
It is an arithmetic number, because the mean of its divisors is an integer number (5000510060556).
Almost surely, 210001020121111 is an apocalyptic number.
10001020121111 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001020121111 is an equidigital number, since it uses as much as digits as its factorization.
10001020121111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10001020121111 its reverse (11112102010001), we get a palindrome (21113122131112).
The spelling of 10001020121111 in words is "ten trillion, one billion, twenty million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •