Base | Representation |
---|---|
bin | 10110101111010110100000… |
… | …010000101100111001011001 |
3 | 111010002221212200221012221211 |
4 | 112233112200100230321121 |
5 | 101102040013032020441 |
6 | 552412230430303121 |
7 | 30031361603362606 |
oct | 2657264020547131 |
9 | 433087780835854 |
10 | 100011002220121 |
11 | 29959478520a83 |
12 | b272976357aa1 |
13 | 43a5cc6669c75 |
14 | 1a9a7b60dd6ad |
15 | b867b064ba81 |
hex | 5af5a042ce59 |
100011002220121 has 2 divisors, whose sum is σ = 100011002220122. Its totient is φ = 100011002220120.
The previous prime is 100011002220071. The next prime is 100011002220163. The reversal of 100011002220121 is 121022200110001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 50256600677721 + 49754401542400 = 7089189^2 + 7053680^2 .
It is a cyclic number.
It is not a de Polignac number, because 100011002220121 - 211 = 100011002218073 is a prime.
It is not a weakly prime, because it can be changed into another prime (100011002229121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005501110060 + 50005501110061.
It is an arithmetic number, because the mean of its divisors is an integer number (50005501110061).
Almost surely, 2100011002220121 is an apocalyptic number.
It is an amenable number.
100011002220121 is a deficient number, since it is larger than the sum of its proper divisors (1).
100011002220121 is an equidigital number, since it uses as much as digits as its factorization.
100011002220121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100011002220121 its reverse (121022200110001), we get a palindrome (221033202330122).
The spelling of 100011002220121 in words is "one hundred trillion, eleven billion, two million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •