Base | Representation |
---|---|
bin | 110011001110110110… |
… | …1000010010011001010 |
3 | 101111222111001122121000 |
4 | 1212131231002103022 |
5 | 3300310110324320 |
6 | 122313102355430 |
7 | 10643253444114 |
oct | 1463555022312 |
9 | 344874048530 |
10 | 110020011210 |
11 | 427284788aa |
12 | 193a558bb76 |
13 | a4b46b5465 |
14 | 5479b123b4 |
15 | 2cddc4bc90 |
hex | 199db424ca |
110020011210 has 64 divisors (see below), whose sum is σ = 303503500800. Its totient is φ = 28326989376.
The previous prime is 110020011161. The next prime is 110020011221. The reversal of 110020011210 is 12110020011.
It is a happy number.
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 = 110020011192 and 110020011201.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7017714 + ... + 7033373.
It is an arithmetic number, because the mean of its divisors is an integer number (4742242200).
Almost surely, 2110020011210 is an apocalyptic number.
110020011210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110020011210 is an abundant number, since it is smaller than the sum of its proper divisors (193483489590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110020011210 is a wasteful number, since it uses less digits than its factorization.
110020011210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14051132 (or 14051126 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110020011210 its reverse (12110020011), we get a palindrome (122130031221).
The spelling of 110020011210 in words is "one hundred ten billion, twenty million, eleven thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •