Base | Representation |
---|---|
bin | 110011001110010100… |
… | …0110000001000011010 |
3 | 101111221020101020010100 |
4 | 1212130220300020122 |
5 | 3300241020023002 |
6 | 122311223000230 |
7 | 10642645341660 |
oct | 1463450601032 |
9 | 344836336110 |
10 | 110002111002 |
11 | 42719362143 |
12 | 1939b599076 |
13 | a4b0a88a14 |
14 | 54775b2c30 |
15 | 2cdc3b311c |
hex | 199ca3021a |
110002111002 has 48 divisors (see below), whose sum is σ = 272740628160. Its totient is φ = 31388276736.
The previous prime is 110002110943. The next prime is 110002111019. The reversal of 110002111002 is 200111200011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 470748 + ... + 664535.
It is an arithmetic number, because the mean of its divisors is an integer number (5682096420).
Almost surely, 2110002111002 is an apocalyptic number.
110002111002 is an abundant number, since it is smaller than the sum of its proper divisors (162738517158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110002111002 is a wasteful number, since it uses less digits than its factorization.
110002111002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1136067 (or 1136064 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110002111002 its reverse (200111200011), we get a palindrome (310113311013).
The spelling of 110002111002 in words is "one hundred ten billion, two million, one hundred eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •