Base | Representation |
---|---|
bin | 10010101000010110… |
… | …00001101010010001 |
3 | 221211001201220001001 |
4 | 21110023001222101 |
5 | 130441020023441 |
6 | 4332255542001 |
7 | 502601353552 |
oct | 112413015221 |
9 | 27731656031 |
10 | 10002111121 |
11 | 4272a27142 |
12 | 1b3182a901 |
13 | c35279362 |
14 | 6ac552329 |
15 | 3d8178731 |
hex | 2542c1a91 |
10002111121 has 2 divisors, whose sum is σ = 10002111122. Its totient is φ = 10002111120.
The previous prime is 10002111101. The next prime is 10002111137. The reversal of 10002111121 is 12111120001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9032411521 + 969699600 = 95039^2 + 31140^2 .
It is an emirp because it is prime and its reverse (12111120001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10002111121 - 29 = 10002110609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10002111098 and 10002111107.
It is not a weakly prime, because it can be changed into another prime (10002111101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5001055560 + 5001055561.
It is an arithmetic number, because the mean of its divisors is an integer number (5001055561).
Almost surely, 210002111121 is an apocalyptic number.
It is an amenable number.
10002111121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10002111121 is an equidigital number, since it uses as much as digits as its factorization.
10002111121 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 10.
Adding to 10002111121 its reverse (12111120001), we get a palindrome (22113231122).
The spelling of 10002111121 in words is "ten billion, two million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •