Base | Representation |
---|---|
bin | 10110110000101011010110… |
… | …110001111010111000001110 |
3 | 111010102200001020120111121020 |
4 | 112300223112301322320032 |
5 | 101110033110432223042 |
6 | 552522135224215010 |
7 | 30041065430130024 |
oct | 2660532661727016 |
9 | 433380036514536 |
10 | 100102111211022 |
11 | 29994081138378 |
12 | b28856260a466 |
13 | 43b178616a37b |
14 | 1aa0d7a3da714 |
15 | b88d440383ec |
hex | 5b0ad6c7ae0e |
100102111211022 has 32 divisors (see below), whose sum is σ = 205956323937792. Its totient is φ = 32419050965184.
The previous prime is 100102111210993. The next prime is 100102111211101. The reversal of 100102111211022 is 220112111201001.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 100102111210992 and 100102111211010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1295479708 + ... + 1295556975.
It is an arithmetic number, because the mean of its divisors is an integer number (6436135123056).
Almost surely, 2100102111211022 is an apocalyptic number.
100102111211022 is an abundant number, since it is smaller than the sum of its proper divisors (105854212726770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100102111211022 is a wasteful number, since it uses less digits than its factorization.
100102111211022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2591036872.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 100102111211022 its reverse (220112111201001), we get a palindrome (320214222412023).
The spelling of 100102111211022 in words is "one hundred trillion, one hundred two billion, one hundred eleven million, two hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •