Base | Representation |
---|---|
bin | 10110110000101011010110… |
… | …110001100100101101011101 |
3 | 111010102200001020101220001020 |
4 | 112300223112301210231131 |
5 | 101110033110421321341 |
6 | 552522135222234353 |
7 | 30041065426301220 |
oct | 2660532661445535 |
9 | 433380036356036 |
10 | 100102111120221 |
11 | 29994081086131 |
12 | b2885625859b9 |
13 | 43b1786137c42 |
14 | 1aa0d7a3b55b7 |
15 | b88d4401b566 |
hex | 5b0ad6c64b5d |
100102111120221 has 32 divisors (see below), whose sum is σ = 155051162572800. Its totient is φ = 56265681132864.
The previous prime is 100102111120189. The next prime is 100102111120223. The reversal of 100102111120221 is 122021111201001.
It is a happy number.
It is not a de Polignac number, because 100102111120221 - 25 = 100102111120189 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100102111120221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100102111120223) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 154977355 + ... + 155621928.
It is an arithmetic number, because the mean of its divisors is an integer number (4845348830400).
Almost surely, 2100102111120221 is an apocalyptic number.
It is an amenable number.
100102111120221 is a deficient number, since it is larger than the sum of its proper divisors (54949051452579).
100102111120221 is a wasteful number, since it uses less digits than its factorization.
100102111120221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310599545.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 100102111120221 its reverse (122021111201001), we get a palindrome (222123222321222).
The spelling of 100102111120221 in words is "one hundred trillion, one hundred two billion, one hundred eleven million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •