Base | Representation |
---|---|
bin | 10110110000110011101001… |
… | …010011110011111111111101 |
3 | 111010110112000120000110102012 |
4 | 112300303221103303333331 |
5 | 101110204323034121341 |
6 | 552530210343341005 |
7 | 30041532126556046 |
oct | 2660635123637775 |
9 | 433415016013365 |
10 | 100111012020221 |
11 | 29997929440034 |
12 | b28a227451765 |
13 | 43b25741cb287 |
14 | 1aa15825918cd |
15 | b891b56700eb |
hex | 5b0ce94f3ffd |
100111012020221 has 16 divisors (see below), whose sum is σ = 106720476323328. Its totient is φ = 93581829792000.
The previous prime is 100111012020181. The next prime is 100111012020247. The reversal of 100111012020221 is 122020210111001.
It is a cyclic number.
It is not a de Polignac number, because 100111012020221 - 234 = 100093832151037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100111012020196 and 100111012020205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100111012020281) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11346911 + ... + 18137651.
It is an arithmetic number, because the mean of its divisors is an integer number (6670029770208).
Almost surely, 2100111012020221 is an apocalyptic number.
It is an amenable number.
100111012020221 is a deficient number, since it is larger than the sum of its proper divisors (6609464303107).
100111012020221 is a wasteful number, since it uses less digits than its factorization.
100111012020221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6796652.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 100111012020221 its reverse (122020210111001), we get a palindrome (222131222131222).
The spelling of 100111012020221 in words is "one hundred trillion, one hundred eleven billion, twelve million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •