Base | Representation |
---|---|
bin | 10111001101111010010010… |
… | …100011010000001101111110 |
3 | 111101112201100221100011010011 |
4 | 113031322102203100031332 |
5 | 101340441322332210420 |
6 | 1001101052335133434 |
7 | 30336164022311230 |
oct | 2715722243201576 |
9 | 441481327304104 |
10 | 102111011210110 |
11 | 2a599044888201 |
12 | b55196b07427a |
13 | 44c904753a996 |
14 | 1b302b0cb0250 |
15 | bc121d53c95a |
hex | 5cde928d037e |
102111011210110 has 32 divisors (see below), whose sum is σ = 210070169899200. Its totient is φ = 35007284132352.
The previous prime is 102111011210101. The next prime is 102111011210123. The reversal of 102111011210110 is 11012110111201.
It is a super-2 number, since 2×1021110112101102 (a number of 29 digits) contains 22 as substring.
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, 44827035 + ... + 47049814.
It is an arithmetic number, because the mean of its divisors is an integer number (6564692809350).
Almost surely, 2102111011210110 is an apocalyptic number.
102111011210110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102111011210110 is an abundant number, since it is smaller than the sum of its proper divisors (107959158689090).
102111011210110 is a wasteful number, since it uses less digits than its factorization.
102111011210110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91892740.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 102111011210110 its reverse (11012110111201), we get a palindrome (113123121321311).
The spelling of 102111011210110 in words is "one hundred two trillion, one hundred eleven billion, eleven million, two hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •