Base | Representation |
---|---|
bin | 10110110000101011010000… |
… | …001010001001000011010101 |
3 | 111010102122202111112111101201 |
4 | 112300223100022021003111 |
5 | 101110032344012320041 |
6 | 552522120215152501 |
7 | 30041062610642404 |
oct | 2660532012110325 |
9 | 433378674474351 |
10 | 100102000120021 |
11 | 29994024461029 |
12 | b288531375731 |
13 | 43b1769142553 |
14 | 1aa0d6975d63b |
15 | b88d393e2631 |
hex | 5b0ad02890d5 |
100102000120021 has 2 divisors, whose sum is σ = 100102000120022. Its totient is φ = 100102000120020.
The previous prime is 100102000119991. The next prime is 100102000120037. The reversal of 100102000120021 is 120021000201001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88452332108100 + 11649668011921 = 9404910^2 + 3413161^2 .
It is a cyclic number.
It is not a de Polignac number, because 100102000120021 - 219 = 100101999595733 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100102000120061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50051000060010 + 50051000060011.
It is an arithmetic number, because the mean of its divisors is an integer number (50051000060011).
Almost surely, 2100102000120021 is an apocalyptic number.
It is an amenable number.
100102000120021 is a deficient number, since it is larger than the sum of its proper divisors (1).
100102000120021 is an equidigital number, since it uses as much as digits as its factorization.
100102000120021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 100102000120021 its reverse (120021000201001), we get a palindrome (220123000321022).
The spelling of 100102000120021 in words is "one hundred trillion, one hundred two billion, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •