Base | Representation |
---|---|
bin | 10110110000111101001001… |
… | …110100110100011100111111 |
3 | 111010111111101001102112220102 |
4 | 112300331021310310130333 |
5 | 101110341230113021114 |
6 | 552535015402111315 |
7 | 30042343124413256 |
oct | 2660751164643477 |
9 | 433444331375812 |
10 | 100121221220159 |
11 | 299a1198251057 |
12 | b2901b64ab53b |
13 | 43b3510344399 |
14 | 1aa1c7040d79d |
15 | b895b1aa32de |
hex | 5b0f49d3473f |
100121221220159 has 2 divisors, whose sum is σ = 100121221220160. Its totient is φ = 100121221220158.
The previous prime is 100121221219969. The next prime is 100121221220201. The reversal of 100121221220159 is 951022122121001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100121221220159 - 216 = 100121221154623 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100121221225159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50060610610079 + 50060610610080.
It is an arithmetic number, because the mean of its divisors is an integer number (50060610610080).
Almost surely, 2100121221220159 is an apocalyptic number.
100121221220159 is a deficient number, since it is larger than the sum of its proper divisors (1).
100121221220159 is an equidigital number, since it uses as much as digits as its factorization.
100121221220159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 29.
The spelling of 100121221220159 in words is "one hundred trillion, one hundred twenty-one billion, two hundred twenty-one million, two hundred twenty thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •