Base | Representation |
---|---|
bin | 1010111010100000010001… |
… | …0000101010011101011110 |
3 | 1120111012122021102101201002 |
4 | 2232220010100222131132 |
5 | 3033102412241231420 |
6 | 41304453113150302 |
7 | 2345662251603056 |
oct | 256500420523536 |
9 | 46435567371632 |
10 | 12000210102110 |
11 | 390729583770a |
12 | 141987a0bb392 |
13 | 6907cc0a3069 |
14 | 2d6b55870566 |
15 | 15c2465c3075 |
hex | aea0442a75e |
12000210102110 has 8 divisors (see below), whose sum is σ = 21600378183816. Its totient is φ = 4800084040840.
The previous prime is 12000210102103. The next prime is 12000210102161. The reversal of 12000210102110 is 1120101200021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12000210102091 and 12000210102100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 600010505096 + ... + 600010505115.
It is an arithmetic number, because the mean of its divisors is an integer number (2700047272977).
Almost surely, 212000210102110 is an apocalyptic number.
12000210102110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12000210102110 is a deficient number, since it is larger than the sum of its proper divisors (9600168081706).
12000210102110 is a wasteful number, since it uses less digits than its factorization.
12000210102110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1200021010218.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 12000210102110 its reverse (1120101200021), we get a palindrome (13120311302131).
The spelling of 12000210102110 in words is "twelve trillion, two hundred ten million, one hundred two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •