Base | Representation |
---|---|
bin | 10110110010010000110111… |
… | …101000000100011010110001 |
3 | 111010211002101120101220101101 |
4 | 112302100313220010122301 |
5 | 101113324323202413014 |
6 | 553044203135004401 |
7 | 30052004505221653 |
oct | 2662206750043261 |
9 | 433732346356341 |
10 | 100211110201009 |
11 | 29a26325234885 |
12 | b2a5702069701 |
13 | 43bbb37165452 |
14 | 1aa635a68c6d3 |
15 | b8bac3300474 |
hex | 5b2437a046b1 |
100211110201009 has 2 divisors, whose sum is σ = 100211110201010. Its totient is φ = 100211110201008.
The previous prime is 100211110200979. The next prime is 100211110201039. The reversal of 100211110201009 is 900102011112001.
It is a balanced prime because it is at equal distance from previous prime (100211110200979) and next prime (100211110201039).
It can be written as a sum of positive squares in only one way, i.e., 85438594890000 + 14772515311009 = 9243300^2 + 3843503^2 .
It is an emirp because it is prime and its reverse (900102011112001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100211110201009 - 27 = 100211110200881 is a prime.
It is not a weakly prime, because it can be changed into another prime (100211110201039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50105555100504 + 50105555100505.
It is an arithmetic number, because the mean of its divisors is an integer number (50105555100505).
Almost surely, 2100211110201009 is an apocalyptic number.
It is an amenable number.
100211110201009 is a deficient number, since it is larger than the sum of its proper divisors (1).
100211110201009 is an equidigital number, since it uses as much as digits as its factorization.
100211110201009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 19.
The spelling of 100211110201009 in words is "one hundred trillion, two hundred eleven billion, one hundred ten million, two hundred one thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.411 sec. • engine limits •