Base | Representation |
---|---|
bin | 1001000111010110111100… |
… | …0000100010000100101110 |
3 | 1022111002120212211122200012 |
4 | 2101311233000202010232 |
5 | 2303200044401041420 |
6 | 33152015233533222 |
7 | 2053032011613320 |
oct | 221655700420456 |
9 | 38432525748605 |
10 | 10022021112110 |
11 | 321435170a527 |
12 | 115a402714212 |
13 | 5790c348cb87 |
14 | 2690d5a07610 |
15 | 125a68341dc5 |
hex | 91d6f02212e |
10022021112110 has 16 divisors (see below), whose sum is σ = 20616729145056. Its totient is φ = 3436121524128.
The previous prime is 10022021112091. The next prime is 10022021112139. The reversal of 10022021112110 is 1121112022001.
It is a super-2 number, since 2×100220211121102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71585865017 + ... + 71585865156.
It is an arithmetic number, because the mean of its divisors is an integer number (1288545571566).
Almost surely, 210022021112110 is an apocalyptic number.
10022021112110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10022021112110 is an abundant number, since it is smaller than the sum of its proper divisors (10594708032946).
10022021112110 is a wasteful number, since it uses less digits than its factorization.
10022021112110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143171730187.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10022021112110 its reverse (1121112022001), we get a palindrome (11143133134111).
The spelling of 10022021112110 in words is "ten trillion, twenty-two billion, twenty-one million, one hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •