Base | Representation |
---|---|
bin | 1010000000101000100100… |
… | …01010011010010100000110 |
3 | 2212221022211222012211021220 |
4 | 11000110102022122110012 |
5 | 10341121100100023420 |
6 | 114452102340221210 |
7 | 4431213115545030 |
oct | 500242212322406 |
9 | 85838758184256 |
10 | 22012012111110 |
11 | 7017272a9177a |
12 | 25760aa39a806 |
13 | c38954360358 |
14 | 56155c19cc50 |
15 | 2828b26c7840 |
hex | 14051229a506 |
22012012111110 has 128 divisors (see below), whose sum is σ = 65989494595584. Its totient is φ = 4582603745280.
The previous prime is 22012012111091. The next prime is 22012012111147. The reversal of 22012012111110 is 1111121021022.
It is a happy number.
It is a super-3 number, since 3×220120121111103 (a number of 41 digits) contains 333 as substring.
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 22012012111110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 99338197 + ... + 99559536.
It is an arithmetic number, because the mean of its divisors is an integer number (515542926528).
Almost surely, 222012012111110 is an apocalyptic number.
22012012111110 is an abundant number, since it is smaller than the sum of its proper divisors (43977482484474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22012012111110 is a wasteful number, since it uses less digits than its factorization.
22012012111110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198897798.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 22012012111110 its reverse (1111121021022), we get a palindrome (23123133132132).
The spelling of 22012012111110 in words is "twenty-two trillion, twelve billion, twelve million, one hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •