Base | Representation |
---|---|
bin | 110011001110010100… |
… | …0110000011000010100 |
3 | 101111221020101021112001 |
4 | 1212130220300120110 |
5 | 3300241020041040 |
6 | 122311223005044 |
7 | 10642645344643 |
oct | 1463450603024 |
9 | 344836337461 |
10 | 110002112020 |
11 | 42719362989 |
12 | 1939b599784 |
13 | a4b0a89318 |
14 | 54775b335a |
15 | 2cdc3b359a |
hex | 199ca30614 |
110002112020 has 48 divisors (see below), whose sum is σ = 231577315200. Its totient is φ = 43891863680.
The previous prime is 110002111997. The next prime is 110002112023. The reversal of 110002112020 is 20211200011.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 110002111988 and 110002112006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110002112023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16194825 + ... + 16201615.
It is an arithmetic number, because the mean of its divisors is an integer number (4824527400).
Almost surely, 2110002112020 is an apocalyptic number.
110002112020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110002112020 is an abundant number, since it is smaller than the sum of its proper divisors (121575203180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110002112020 is a wasteful number, since it uses less digits than its factorization.
110002112020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8688 (or 8686 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 110002112020 its reverse (20211200011), we get a palindrome (130213312031).
The spelling of 110002112020 in words is "one hundred ten billion, two million, one hundred twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •