Base | Representation |
---|---|
bin | 10110110000110010111001… |
… | …100000101111001101011110 |
3 | 111010110102221200001210120102 |
4 | 112300302321200233031132 |
5 | 101110201202241231420 |
6 | 552525555015421102 |
7 | 30041503221433265 |
oct | 2660627140571536 |
9 | 433412850053512 |
10 | 100110210102110 |
11 | 2999755780a09a |
12 | b28a042984792 |
13 | 43b2477026310 |
14 | 1aa1507c875dc |
15 | b8916a069a75 |
hex | 5b0cb982f35e |
100110210102110 has 64 divisors (see below), whose sum is σ = 197000119939392. Its totient is φ = 36403953417216.
The previous prime is 100110210102083. The next prime is 100110210102187. The reversal of 100110210102110 is 11201012011001.
It is a junction number, because it is equal to n+sod(n) for n = 100110210102091 and 100110210102100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37854962 + ... + 40413098.
It is an arithmetic number, because the mean of its divisors is an integer number (3078126874053).
Almost surely, 2100110210102110 is an apocalyptic number.
100110210102110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100110210102110 is a deficient number, since it is larger than the sum of its proper divisors (96889909837282).
100110210102110 is a wasteful number, since it uses less digits than its factorization.
100110210102110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2562717.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 100110210102110 its reverse (11201012011001), we get a palindrome (111311222113111).
The spelling of 100110210102110 in words is "one hundred trillion, one hundred ten billion, two hundred ten million, one hundred two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •