Base | Representation |
---|---|
bin | 10001101000111101011… |
… | …010011100011111101110 |
3 | 11021212221002002021200020 |
4 | 101220331122130133232 |
5 | 124330102021320420 |
6 | 2324514311143010 |
7 | 153402502340214 |
oct | 21507532343756 |
9 | 4255832067606 |
10 | 1212211120110 |
11 | 4281066363a1 |
12 | 176b27074a66 |
13 | 8a4073cb173 |
14 | 429581c0cb4 |
15 | 217ebc60340 |
hex | 11a3d69c7ee |
1212211120110 has 64 divisors (see below), whose sum is σ = 2921128875072. Its totient is φ = 321943781376.
The previous prime is 1212211120063. The next prime is 1212211120139. The reversal of 1212211120110 is 110211122121.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1212211120110.
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, 19023022 + ... + 19086638.
It is an arithmetic number, because the mean of its divisors is an integer number (45642638673).
Almost surely, 21212211120110 is an apocalyptic number.
1212211120110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1212211120110 is an abundant number, since it is smaller than the sum of its proper divisors (1708917754962).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1212211120110 is a wasteful number, since it uses less digits than its factorization.
1212211120110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66197.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1212211120110 its reverse (110211122121), we get a palindrome (1322422242231).
The spelling of 1212211120110 in words is "one trillion, two hundred twelve billion, two hundred eleven million, one hundred twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •