Base | Representation |
---|---|
bin | 1010111011110001110110… |
… | …1010110000101001111110 |
3 | 1120120022011121012221212020 |
4 | 2232330131222300221332 |
5 | 3033432240432210420 |
6 | 41322514234021010 |
7 | 2350366060132641 |
oct | 256743552605176 |
9 | 46508147187766 |
10 | 12022111210110 |
11 | 39156043a9271 |
12 | 1421b70877766 |
13 | 6928ac5ab971 |
14 | 2d7c3242ba58 |
15 | 15cac91ba340 |
hex | aef1dab0a7e |
12022111210110 has 16 divisors (see below), whose sum is σ = 28853066904336. Its totient is φ = 3205896322688.
The previous prime is 12022111210049. The next prime is 12022111210141. The reversal of 12022111210110 is 1101211122021.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 12022111210110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 200368520139 + ... + 200368520198.
It is an arithmetic number, because the mean of its divisors is an integer number (1803316681521).
Almost surely, 212022111210110 is an apocalyptic number.
12022111210110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12022111210110 is an abundant number, since it is smaller than the sum of its proper divisors (16830955694226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12022111210110 is a wasteful number, since it uses less digits than its factorization.
12022111210110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 400737040347.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 12022111210110 its reverse (1101211122021), we get a palindrome (13123322332131).
The spelling of 12022111210110 in words is "twelve trillion, twenty-two billion, one hundred eleven million, two hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •