Base | Representation |
---|---|
bin | 110011010100001101… |
… | …1101101110000101000 |
3 | 101112110000210001020112 |
4 | 1212220123231300220 |
5 | 3301142201120013 |
6 | 122343012513452 |
7 | 10650600500111 |
oct | 1465033556050 |
9 | 345400701215 |
10 | 110200020008 |
11 | 42810047101 |
12 | 1943591b888 |
13 | a512a90340 |
14 | 54959ad208 |
15 | 2cee957ba8 |
hex | 19a86edc28 |
110200020008 has 64 divisors (see below), whose sum is σ = 227012965200. Its totient is φ = 49844551680.
The previous prime is 110200020001. The next prime is 110200020013. The reversal of 110200020008 is 800020002011.
It can be written as a sum of positive squares in 8 ways, for example, as 9927731044 + 100272288964 = 99638^2 + 316658^2 .
It is a junction number, because it is equal to n+sod(n) for n = 110200019974 and 110200020001.
It is not an unprimeable number, because it can be changed into a prime (110200020001) 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, 993248 + ... + 1098608.
Almost surely, 2110200020008 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 110200020008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (113506482600).
110200020008 is an abundant number, since it is smaller than the sum of its proper divisors (116812945192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110200020008 is a wasteful number, since it uses less digits than its factorization.
110200020008 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105582 (or 105578 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 110200020008 its reverse (800020002011), we get a palindrome (910220022019).
The spelling of 110200020008 in words is "one hundred ten billion, two hundred million, twenty thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •