Base | Representation |
---|---|
bin | 110011001110111010… |
… | …1011011001001001000 |
3 | 101111222122012100221010 |
4 | 1212131311123021020 |
5 | 3300311141210440 |
6 | 122313221443520 |
7 | 10643311232664 |
oct | 1463565331110 |
9 | 344878170833 |
10 | 110022210120 |
11 | 4272973a989 |
12 | 193a62705a0 |
13 | a4b4ca52a4 |
14 | 547a1258a4 |
15 | 2cde033580 |
hex | 199dd5b248 |
110022210120 has 64 divisors (see below), whose sum is σ = 330089365440. Its totient is φ = 29337235200.
The previous prime is 110022210083. The next prime is 110022210161. The reversal of 110022210120 is 21012220011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 110022210096 and 110022210105.
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 15 ways as a sum of consecutive naturals, for example, 2694255 + ... + 2734785.
It is an arithmetic number, because the mean of its divisors is an integer number (5157646335).
Almost surely, 2110022210120 is an apocalyptic number.
110022210120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110022210120 is an abundant number, since it is smaller than the sum of its proper divisors (220067155320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110022210120 is a wasteful number, since it uses less digits than its factorization.
110022210120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63166 (or 63162 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 110022210120 its reverse (21012220011), we get a palindrome (131034430131).
The spelling of 110022210120 in words is "one hundred ten billion, twenty-two million, two hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •