Base | Representation |
---|---|
bin | 1010111010100000010001… |
… | …0000101001111110001110 |
3 | 1120111012122021102021222000 |
4 | 2232220010100221332032 |
5 | 3033102412241200420 |
6 | 41304453113133130 |
7 | 2345662251564201 |
oct | 256500420517616 |
9 | 46435567367860 |
10 | 12000210100110 |
11 | 3907295836161 |
12 | 141987a0ba1a6 |
13 | 6907cc0a218b |
14 | 2d6b5586d938 |
15 | 15c2465c2690 |
hex | aea04429f8e |
12000210100110 has 64 divisors (see below), whose sum is σ = 32001291466560. Its totient is φ = 3199982906880.
The previous prime is 12000210100103. The next prime is 12000210100163. The reversal of 12000210100110 is 1100101200021.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 12000210100092 and 12000210100101.
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, 11890050 + ... + 12859770.
It is an arithmetic number, because the mean of its divisors is an integer number (500020179165).
Almost surely, 212000210100110 is an apocalyptic number.
12000210100110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12000210100110 is an abundant number, since it is smaller than the sum of its proper divisors (20001081366450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12000210100110 is a wasteful number, since it uses less digits than its factorization.
12000210100110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1015570 (or 1015564 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 12000210100110 its reverse (1100101200021), we get a palindrome (13100311300131).
The spelling of 12000210100110 in words is "twelve trillion, two hundred ten million, one hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •