Base | Representation |
---|---|
bin | 1011000000011011011101… |
… | …1110100011010000101110 |
3 | 1120211221101021011110210111 |
4 | 2300012313132203100232 |
5 | 3041234344241041420 |
6 | 41423325455530234 |
7 | 2356224604114060 |
oct | 260066736432056 |
9 | 46757337143714 |
10 | 12102001112110 |
11 | 3946480147068 |
12 | 143554782997a |
13 | 69a2a1975920 |
14 | 2dba50707730 |
15 | 15ec02b8c45a |
hex | b01b77a342e |
12102001112110 has 64 divisors (see below), whose sum is σ = 26816005706112. Its totient is φ = 3829309779456.
The previous prime is 12102001112093. The next prime is 12102001112161. The reversal of 12102001112110 is 1121110020121.
It is a happy number.
12102001112110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (13).
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, 3169444 + ... + 5852296.
It is an arithmetic number, because the mean of its divisors is an integer number (419000089158).
Almost surely, 212102001112110 is an apocalyptic number.
12102001112110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12102001112110 is an abundant number, since it is smaller than the sum of its proper divisors (14714004594002).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12102001112110 is a wasteful number, since it uses less digits than its factorization.
12102001112110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2687837.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12102001112110 its reverse (1121110020121), we get a palindrome (13223111132231).
The spelling of 12102001112110 in words is "twelve trillion, one hundred two billion, one million, one hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •