Base | Representation |
---|---|
bin | 10110110000101011010000… |
… | …001010000110111000010010 |
3 | 111010102122202111112001012010 |
4 | 112300223100022012320102 |
5 | 101110032344012023442 |
6 | 552522120215043350 |
7 | 30041062610604432 |
oct | 2660532012067022 |
9 | 433378674461163 |
10 | 100102000111122 |
11 | 29994024455379 |
12 | b288531370556 |
13 | 43b176913b499 |
14 | 1aa0d6975a2c2 |
15 | b88d393deb9c |
hex | 5b0ad0286e12 |
100102000111122 has 16 divisors (see below), whose sum is σ = 210741052865760. Its totient is φ = 31611157929792.
The previous prime is 100102000111097. The next prime is 100102000111129. The reversal of 100102000111122 is 221111000201001.
It is a junction number, because it is equal to n+sod(n) for n = 100102000111098 and 100102000111107.
It is not an unprimeable number, because it can be changed into a prime (100102000111129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 439043860023 + ... + 439043860250.
It is an arithmetic number, because the mean of its divisors is an integer number (13171315804110).
Almost surely, 2100102000111122 is an apocalyptic number.
100102000111122 is an abundant number, since it is smaller than the sum of its proper divisors (110639052754638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100102000111122 is a wasteful number, since it uses less digits than its factorization.
100102000111122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 878087720297.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100102000111122 its reverse (221111000201001), we get a palindrome (321213000312123).
The spelling of 100102000111122 in words is "one hundred trillion, one hundred two billion, one hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •