Base | Representation |
---|---|
bin | 10110110000111101001001… |
… | …110000100101011110000001 |
3 | 111010111111100222100011100011 |
4 | 112300331021300211132001 |
5 | 101110341224322011314 |
6 | 552535015322224521 |
7 | 30042343112111254 |
oct | 2660751160453601 |
9 | 433444328304304 |
10 | 100121220110209 |
11 | 299a1197663141 |
12 | b2901b6055141 |
13 | 43b35100460cc |
14 | 1aa1c7020109b |
15 | b895b19344c4 |
hex | 5b0f49c25781 |
100121220110209 has 2 divisors, whose sum is σ = 100121220110210. Its totient is φ = 100121220110208.
The previous prime is 100121220110207. The next prime is 100121220110251. The reversal of 100121220110209 is 902011022121001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78200470668609 + 21920749441600 = 8843103^2 + 4681960^2 .
It is a cyclic number.
It is not a de Polignac number, because 100121220110209 - 21 = 100121220110207 is a prime.
Together with 100121220110207, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 100121220110209.
It is not a weakly prime, because it can be changed into another prime (100121220110207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50060610055104 + 50060610055105.
It is an arithmetic number, because the mean of its divisors is an integer number (50060610055105).
Almost surely, 2100121220110209 is an apocalyptic number.
It is an amenable number.
100121220110209 is a deficient number, since it is larger than the sum of its proper divisors (1).
100121220110209 is an equidigital number, since it uses as much as digits as its factorization.
100121220110209 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 100121220110209 in words is "one hundred trillion, one hundred twenty-one billion, two hundred twenty million, one hundred ten thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •