Base | Representation |
---|---|
bin | 1010111011000101100001… |
… | …0011101010101010101010 |
3 | 1120112011110012012102211012 |
4 | 2232301120103222222222 |
5 | 3033233402242010442 |
6 | 41313225300103522 |
7 | 2346465126350300 |
oct | 256613023525252 |
9 | 46464405172735 |
10 | 12010210110122 |
11 | 3910557557744 |
12 | 141b7ab094ba2 |
13 | 691733a94073 |
14 | 2d74239d6270 |
15 | 15c62e483582 |
hex | aec584eaaaa |
12010210110122 has 24 divisors (see below), whose sum is σ = 20957099033700. Its totient is φ = 5147108151360.
The previous prime is 12010210110121. The next prime is 12010210110127. The reversal of 12010210110122 is 22101101201021.
12010210110122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 10050935243041 + 1959274867081 = 3170321^2 + 1399741^2 .
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 12010210110097 and 12010210110106.
It is not an unprimeable number, because it can be changed into a prime (12010210110121) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2636972 + ... + 5565432.
Almost surely, 212010210110122 is an apocalyptic number.
12010210110122 is a deficient number, since it is larger than the sum of its proper divisors (8946888923578).
12010210110122 is a wasteful number, since it uses less digits than its factorization.
12010210110122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2970326 (or 2970319 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 12010210110122 its reverse (22101101201021), we get a palindrome (34111311311143).
The spelling of 12010210110122 in words is "twelve trillion, ten billion, two hundred ten million, one hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •