Base | Representation |
---|---|
bin | 1010111011000101000111… |
… | …0000000011101011101110 |
3 | 1120112011011112012221220202 |
4 | 2232301101300003223232 |
5 | 3033233141112041420 |
6 | 41313210330313502 |
7 | 2346462322364342 |
oct | 256612160035356 |
9 | 46464145187822 |
10 | 12010100112110 |
11 | 39105004575a1 |
12 | 141b77a288892 |
13 | 69171705c899 |
14 | 2d7413161622 |
15 | 15c6249a6575 |
hex | aec51c03aee |
12010100112110 has 32 divisors (see below), whose sum is σ = 22142766428640. Its totient is φ = 4687685912448.
The previous prime is 12010100112079. The next prime is 12010100112119. The reversal of 12010100112110 is 1121100101021.
12010100112110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 12010100112091 and 12010100112100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12010100112119) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13350425 + ... + 14221604.
It is an arithmetic number, because the mean of its divisors is an integer number (691961450895).
Almost surely, 212010100112110 is an apocalyptic number.
12010100112110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12010100112110 is a deficient number, since it is larger than the sum of its proper divisors (10132666316530).
12010100112110 is a wasteful number, since it uses less digits than its factorization.
12010100112110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27573092.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 12010100112110 its reverse (1121100101021), we get a palindrome (13131200213131).
The spelling of 12010100112110 in words is "twelve trillion, ten billion, one hundred million, one hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •