Base | Representation |
---|---|
bin | 110011001110100111… |
… | …1010001101101011010 |
3 | 101111221221101022100200 |
4 | 1212131033101231122 |
5 | 3300301111210020 |
6 | 122312223243030 |
7 | 10643130233103 |
oct | 1463517215532 |
9 | 344857338320 |
10 | 110012210010 |
11 | 4272402a72a |
12 | 193a2a49476 |
13 | a4b2bb3671 |
14 | 5478a813aa |
15 | 2cdd20a590 |
hex | 199d3d1b5a |
110012210010 has 48 divisors (see below), whose sum is σ = 286053282216. Its totient is φ = 29334380544.
The previous prime is 110012210003. The next prime is 110012210051. The reversal of 110012210010 is 10012210011.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 98917169121 + 11095040889 = 314511^2 + 105333^2 .
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 = 110012209974 and 110012210001.
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, 1410762 + ... + 1486698.
Almost surely, 2110012210010 is an apocalyptic number.
110012210010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110012210010 is an abundant number, since it is smaller than the sum of its proper divisors (176041072206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110012210010 is a wasteful number, since it uses less digits than its factorization.
110012210010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92047 (or 92044 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110012210010 its reverse (10012210011), we get a palindrome (120024420021).
Subtracting from 110012210010 its reverse (10012210011), we obtain a palindrome (99999999999).
The spelling of 110012210010 in words is "one hundred ten billion, twelve million, two hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •