Base | Representation |
---|---|
bin | 1001001100100110100001… |
… | …0000010001001110101000 |
3 | 1022210201002210010111011211 |
4 | 2103021220100101032220 |
5 | 2311134041120010440 |
6 | 33301234030202504 |
7 | 2062401213510553 |
oct | 223115020211650 |
9 | 38721083114154 |
10 | 10112102110120 |
11 | 324957802361a |
12 | 1173962653434 |
13 | 58474b00186a |
14 | 26d5dd58b69a |
15 | 12808b86ceea |
hex | 932684113a8 |
10112102110120 has 32 divisors (see below), whose sum is σ = 22761737790120. Its totient is φ = 4043150525440.
The previous prime is 10112102110081. The next prime is 10112102110133. The reversal of 10112102110120 is 2101120121101.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 5174560354756 + 4937541755364 = 2274766^2 + 2222058^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 10112102110120.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52725541 + ... + 52916980.
Almost surely, 210112102110120 is an apocalyptic number.
10112102110120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10112102110120 is an abundant number, since it is smaller than the sum of its proper divisors (12649635680000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10112102110120 is a wasteful number, since it uses less digits than its factorization.
10112102110120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105644925 (or 105644921 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10112102110120 its reverse (2101120121101), we get a palindrome (12213222231221).
The spelling of 10112102110120 in words is "ten trillion, one hundred twelve billion, one hundred two million, one hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •