Base | Representation |
---|---|
bin | 110011010100001101… |
… | …1101011100101011110 |
3 | 101112110000202121000200 |
4 | 1212220123223211132 |
5 | 3301142200323402 |
6 | 122343012404330 |
7 | 10650600432126 |
oct | 1465033534536 |
9 | 345400677020 |
10 | 110200011102 |
11 | 42810040445 |
12 | 194359166a6 |
13 | a512a8927c |
14 | 54959a9c86 |
15 | 2cee95521c |
hex | 19a86eb95e |
110200011102 has 24 divisors (see below), whose sum is σ = 240196437936. Its totient is φ = 36513375936.
The previous prime is 110200011083. The next prime is 110200011157. The reversal of 110200011102 is 201110002011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18327003 + ... + 18333014.
It is an arithmetic number, because the mean of its divisors is an integer number (10008184914).
Almost surely, 2110200011102 is an apocalyptic number.
110200011102 is an abundant number, since it is smaller than the sum of its proper divisors (129996426834).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110200011102 is a wasteful number, since it uses less digits than its factorization.
110200011102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36660192 (or 36660189 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110200011102 its reverse (201110002011), we get a palindrome (311310013113).
Subtracting 110200011102 from its reverse (201110002011), we obtain a palindrome (90909990909).
The spelling of 110200011102 in words is "one hundred ten billion, two hundred million, eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •