Base | Representation |
---|---|
bin | 10110110000110010101110… |
… | …010011001100000101111101 |
3 | 111010110102110120010021101102 |
4 | 112300302232103030011331 |
5 | 101110200311113013041 |
6 | 552525524220022445 |
7 | 30041465445544514 |
oct | 2660625623140575 |
9 | 433412416107342 |
10 | 100110022001021 |
11 | 29997470613a4a |
12 | b289bab991a25 |
13 | 43b2447076cb6 |
14 | 1aa14cacc167b |
15 | b891587b109b |
hex | 5b0cae4cc17d |
100110022001021 has 2 divisors, whose sum is σ = 100110022001022. Its totient is φ = 100110022001020.
The previous prime is 100110022000997. The next prime is 100110022001027. The reversal of 100110022001021 is 120100220011001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 73261188525625 + 26848833475396 = 8559275^2 + 5181586^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100110022001021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100110022000993 and 100110022001011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100110022001027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055011000510 + 50055011000511.
It is an arithmetic number, because the mean of its divisors is an integer number (50055011000511).
Almost surely, 2100110022001021 is an apocalyptic number.
It is an amenable number.
100110022001021 is a deficient number, since it is larger than the sum of its proper divisors (1).
100110022001021 is an equidigital number, since it uses as much as digits as its factorization.
100110022001021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100110022001021 its reverse (120100220011001), we get a palindrome (220210242012022).
The spelling of 100110022001021 in words is "one hundred trillion, one hundred ten billion, twenty-two million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •