Base | Representation |
---|---|
bin | 10111001100010011111100… |
… | …100101110010110001011001 |
3 | 111101011012201111201201121012 |
4 | 113030103330211302301121 |
5 | 101332141244001024004 |
6 | 1000534400153023305 |
7 | 30325223604011012 |
oct | 2714237445626131 |
9 | 441135644651535 |
10 | 102001121111129 |
11 | 2a556483781389 |
12 | b5346010b4b35 |
13 | 44bb883a40086 |
14 | 1b28c48538009 |
15 | bbd43ae0346e |
hex | 5cc4fc972c59 |
102001121111129 has 2 divisors, whose sum is σ = 102001121111130. Its totient is φ = 102001121111128.
The previous prime is 102001121111093. The next prime is 102001121111137. The reversal of 102001121111129 is 921111121100201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 72446023779529 + 29555097331600 = 8511523^2 + 5436460^2 .
It is a cyclic number.
It is not a de Polignac number, because 102001121111129 - 232 = 101996826143833 is a prime.
It is not a weakly prime, because it can be changed into another prime (102001121111159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51000560555564 + 51000560555565.
It is an arithmetic number, because the mean of its divisors is an integer number (51000560555565).
Almost surely, 2102001121111129 is an apocalyptic number.
It is an amenable number.
102001121111129 is a deficient number, since it is larger than the sum of its proper divisors (1).
102001121111129 is an equidigital number, since it uses as much as digits as its factorization.
102001121111129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 23.
The spelling of 102001121111129 in words is "one hundred two trillion, one billion, one hundred twenty-one million, one hundred eleven thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •