Base | Representation |
---|---|
bin | 1010111011001100100110… |
… | …0011001101111100110010 |
3 | 1120112100100121012110112012 |
4 | 2232303021203031330302 |
5 | 3033301300130342320 |
6 | 41314142005402522 |
7 | 2346563166301400 |
oct | 256631143157462 |
9 | 46470317173465 |
10 | 12012110012210 |
11 | 3911341a46260 |
12 | 142003b409442 |
13 | 691977592199 |
14 | 2d7564076470 |
15 | 15c6e11724c5 |
hex | aecc98cdf32 |
12012110012210 has 48 divisors (see below), whose sum is σ = 27438422734080. Its totient is φ = 3744034287840.
The previous prime is 12012110012173. The next prime is 12012110012213. The reversal of 12012110012210 is 1221001121021.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12012110012213) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1114290530 + ... + 1114301309.
It is an arithmetic number, because the mean of its divisors is an integer number (571633806960).
Almost surely, 212012110012210 is an apocalyptic number.
12012110012210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12012110012210 is an abundant number, since it is smaller than the sum of its proper divisors (15426312721870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12012110012210 is a wasteful number, since it uses less digits than its factorization.
12012110012210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2228591871 (or 2228591864 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 12012110012210 its reverse (1221001121021), we get a palindrome (13233111133231).
The spelling of 12012110012210 in words is "twelve trillion, twelve billion, one hundred ten million, twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •