Base | Representation |
---|---|
bin | 110011001110010010… |
… | …0111110001101100110 |
3 | 101111221011111212212100 |
4 | 1212130210332031212 |
5 | 3300240241320402 |
6 | 122311145432530 |
7 | 10642634044026 |
oct | 1463444761546 |
9 | 344834455770 |
10 | 110001120102 |
11 | 42718845715 |
12 | 1939b19b746 |
13 | a4b07cc9a3 |
14 | 54773d5a86 |
15 | 2cdc26971c |
hex | 199c93e366 |
110001120102 has 48 divisors (see below), whose sum is σ = 247300889472. Its totient is φ = 35308224000.
The previous prime is 110001120083. The next prime is 110001120127. The reversal of 110001120102 is 201021100011.
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 23 ways as a sum of consecutive naturals, for example, 786774 + ... + 915977.
It is an arithmetic number, because the mean of its divisors is an integer number (5152101864).
Almost surely, 2110001120102 is an apocalyptic number.
110001120102 is an abundant number, since it is smaller than the sum of its proper divisors (137299769370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110001120102 is a wasteful number, since it uses less digits than its factorization.
110001120102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1702893 (or 1702890 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110001120102 its reverse (201021100011), we get a palindrome (311022220113).
It can be divided in two parts, 1100011 and 20102, that multiplied together give a palindrome (22112421122).
The spelling of 110001120102 in words is "one hundred ten billion, one million, one hundred twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •