Base | Representation |
---|---|
bin | 1001001101001000011100… |
… | …1000000111001100000001 |
3 | 1022211120121112020020110102 |
4 | 2103102013020013030001 |
5 | 2311311214230001004 |
6 | 33305341504012145 |
7 | 2063143006345004 |
oct | 223220710071401 |
9 | 38746545206412 |
10 | 10121210000129 |
11 | 3252421205148 |
12 | 1175684901055 |
13 | 58556cc289a7 |
14 | 26dc2504953b |
15 | 12842125c11e |
hex | 93487207301 |
10121210000129 has 2 divisors, whose sum is σ = 10121210000130. Its totient is φ = 10121210000128.
The previous prime is 10121210000009. The next prime is 10121210000179. The reversal of 10121210000129 is 92100001212101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10001577025729 + 119632974400 = 3162527^2 + 345880^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10121210000129 is a prime.
It is a super-2 number, since 2×101212100001292 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10121210000129.
It is not a weakly prime, because it can be changed into another prime (10121210000179) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060605000064 + 5060605000065.
It is an arithmetic number, because the mean of its divisors is an integer number (5060605000065).
Almost surely, 210121210000129 is an apocalyptic number.
It is an amenable number.
10121210000129 is a deficient number, since it is larger than the sum of its proper divisors (1).
10121210000129 is an equidigital number, since it uses as much as digits as its factorization.
10121210000129 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 10121210000129 in words is "ten trillion, one hundred twenty-one billion, two hundred ten million, one hundred twenty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •