Base | Representation |
---|---|
bin | 110011001110100011… |
… | …1010001010001111110 |
3 | 101111221210102200012100 |
4 | 1212131013101101332 |
5 | 3300300042023402 |
6 | 122312110245530 |
7 | 10643103341613 |
oct | 1463507212176 |
9 | 344853380170 |
10 | 110010111102 |
11 | 427229267a1 |
12 | 193a21b68a6 |
13 | a4b262a1c8 |
14 | 547869650a |
15 | 2cdce4371c |
hex | 199d1d147e |
110010111102 has 48 divisors (see below), whose sum is σ = 259197140592. Its totient is φ = 33580189440.
The previous prime is 110010111083. The next prime is 110010111151. The reversal of 110010111102 is 201111010011.
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 23 ways as a sum of consecutive naturals, for example, 4846924 + ... + 4869567.
It is an arithmetic number, because the mean of its divisors is an integer number (5399940429).
Almost surely, 2110010111102 is an apocalyptic number.
110010111102 is an abundant number, since it is smaller than the sum of its proper divisors (149187029490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110010111102 is a wasteful number, since it uses less digits than its factorization.
110010111102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9716553 (or 9716550 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110010111102 its reverse (201111010011), we get a palindrome (311121121113).
The spelling of 110010111102 in words is "one hundred ten billion, ten million, one hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •