Base | Representation |
---|---|
bin | 1010111011001100010001… |
… | …0011110111100011000010 |
3 | 1120112100010110210011200021 |
4 | 2232303010103313203002 |
5 | 3033301110124232320 |
6 | 41314125145244054 |
7 | 2346561051132124 |
oct | 256630423674302 |
9 | 46470113704607 |
10 | 12012022102210 |
11 | 39112a7362169 |
12 | 1420015a9362a |
13 | 6919622c2630 |
14 | 2d7556511214 |
15 | 15c6d85a9daa |
hex | aecc44f78c2 |
12012022102210 has 128 divisors (see below), whose sum is σ = 24741279601920. Its totient is φ = 4162366227456.
The previous prime is 12012022102189. The next prime is 12012022102217. The reversal of 12012022102210 is 1220122021021.
It is a happy number.
12012022102210 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (12012022102217) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 118314129 + ... + 118415611.
It is an arithmetic number, because the mean of its divisors is an integer number (193291246890).
Almost surely, 212012022102210 is an apocalyptic number.
12012022102210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12012022102210 is an abundant number, since it is smaller than the sum of its proper divisors (12729257499710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12012022102210 is a wasteful number, since it uses less digits than its factorization.
12012022102210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101972.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 12012022102210 its reverse (1220122021021), we get a palindrome (13232144123231).
The spelling of 12012022102210 in words is "twelve trillion, twelve billion, twenty-two million, one hundred two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •