Base | Representation |
---|---|
bin | 10110110000101011010110… |
… | …101101110000100010100101 |
3 | 111010102200001011112002010202 |
4 | 112300223112231300202211 |
5 | 101110033110142320401 |
6 | 552522135145000245 |
7 | 30041065414634345 |
oct | 2660532655604245 |
9 | 433380034462122 |
10 | 100102110120101 |
11 | 29994080562791 |
12 | b288562183085 |
13 | 43b1785b7795b |
14 | 1aa0d7a1d4d25 |
15 | b88d43dc006b |
hex | 5b0ad6b708a5 |
100102110120101 has 32 divisors (see below), whose sum is σ = 103354074869760. Its totient is φ = 96905334052800.
The previous prime is 100102110120079. The next prime is 100102110120113. The reversal of 100102110120101 is 101021011201001.
It is a cyclic number.
It is not a de Polignac number, because 100102110120101 - 26 = 100102110120037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100102110120301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16736681531 + ... + 16736687511.
It is an arithmetic number, because the mean of its divisors is an integer number (3229814839680).
Almost surely, 2100102110120101 is an apocalyptic number.
It is an amenable number.
100102110120101 is a deficient number, since it is larger than the sum of its proper divisors (3251964749659).
100102110120101 is a wasteful number, since it uses less digits than its factorization.
100102110120101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10145.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 100102110120101 its reverse (101021011201001), we get a palindrome (201123121321102).
The spelling of 100102110120101 in words is "one hundred trillion, one hundred two billion, one hundred ten million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •