Base | Representation |
---|---|
bin | 110011001110010010… |
… | …0100101110001110110 |
3 | 101111221011022210120200 |
4 | 1212130210211301312 |
5 | 3300240230120042 |
6 | 122311143341330 |
7 | 10642633146165 |
oct | 1463444456166 |
9 | 344834283520 |
10 | 110001020022 |
11 | 42718787503 |
12 | 1939b151846 |
13 | a4b079627a |
14 | 54773ab3dc |
15 | 2cdc249c4c |
hex | 199c925c76 |
110001020022 has 24 divisors (see below), whose sum is σ = 238446326664. Its totient is φ = 36649963104.
The previous prime is 110001019993. The next prime is 110001020039. The reversal of 110001020022 is 220020100011.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 110001019986 and 110001020013.
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 11 ways as a sum of consecutive naturals, for example, 1380468 + ... + 1457975.
It is an arithmetic number, because the mean of its divisors is an integer number (9935263611).
Almost surely, 2110001020022 is an apocalyptic number.
110001020022 is an abundant number, since it is smaller than the sum of its proper divisors (128445306642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110001020022 is a wasteful number, since it uses less digits than its factorization.
110001020022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2840604 (or 2840601 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 110001020022 its reverse (220020100011), we get a palindrome (330021120033).
The spelling of 110001020022 in words is "one hundred ten billion, one million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.544 sec. • engine limits •