Base | Representation |
---|---|
bin | 10110101111001101011001… |
… | …001111001100111010000101 |
3 | 111010002000122000022000121222 |
4 | 112233031121033030322011 |
5 | 101101410000000210041 |
6 | 552403532050450125 |
7 | 30030564321044501 |
oct | 2657153117147205 |
9 | 433060560260558 |
10 | 100001220710021 |
11 | 29955309078734 |
12 | b270aa6593945 |
13 | 43a50c800ba77 |
14 | 1a9a128db3301 |
15 | b863dba4b74b |
hex | 5af3593cce85 |
100001220710021 has 2 divisors, whose sum is σ = 100001220710022. Its totient is φ = 100001220710020.
The previous prime is 100001220710003. The next prime is 100001220710023. The reversal of 100001220710021 is 120017022100001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 89246848173025 + 10754372536996 = 9447055^2 + 3279386^2 .
It is a cyclic number.
It is not a de Polignac number, because 100001220710021 - 238 = 99726342803077 is a prime.
Together with 100001220710023, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100001220710023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000610355010 + 50000610355011.
It is an arithmetic number, because the mean of its divisors is an integer number (50000610355011).
Almost surely, 2100001220710021 is an apocalyptic number.
It is an amenable number.
100001220710021 is a deficient number, since it is larger than the sum of its proper divisors (1).
100001220710021 is an equidigital number, since it uses as much as digits as its factorization.
100001220710021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 17.
Adding to 100001220710021 its reverse (120017022100001), we get a palindrome (220018242810022).
The spelling of 100001220710021 in words is "one hundred trillion, one billion, two hundred twenty million, seven hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •