Base | Representation |
---|---|
bin | 10110010111111100… |
… | …01001011101010110 |
3 | 1011000010200212210000 |
4 | 23023332021131112 |
5 | 144100033013420 |
6 | 5303534512130 |
7 | 603445216254 |
oct | 131376113526 |
9 | 34003625700 |
10 | 12012001110 |
11 | 510450924a |
12 | 23b2965646 |
13 | 11957a7185 |
14 | 81d4635d4 |
15 | 4a4841690 |
hex | 2cbf89756 |
12012001110 has 80 divisors (see below), whose sum is σ = 32612744736. Its totient is φ = 3172079232.
The previous prime is 12012001103. The next prime is 12012001129. The reversal of 12012001110 is 1110021021.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12012001092 and 12012001101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 11442 + ... + 155418.
Almost surely, 212012001110 is an apocalyptic number.
12012001110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 12012001110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16306372368).
12012001110 is an abundant number, since it is smaller than the sum of its proper divisors (20600743626).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12012001110 is a wasteful number, since it uses less digits than its factorization.
12012001110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 144099 (or 144090 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 12012001110 its reverse (1110021021), we get a palindrome (13122022131).
The spelling of 12012001110 in words is "twelve billion, twelve million, one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •