Base | Representation |
---|---|
bin | 10000000000011101110… |
… | …100110001001101110000 |
3 | 10220011022201122102210100 |
4 | 100000131310301031300 |
5 | 121010311033000422 |
6 | 2201201042432400 |
7 | 142321215504204 |
oct | 20003564611560 |
9 | 3804281572710 |
10 | 1100012000112 |
11 | 394570107943 |
12 | 159233962700 |
13 | 7c96641a32c |
14 | 3b352d0cb04 |
15 | 1d931a717ac |
hex | 1001dd31370 |
1100012000112 has 30 divisors (see below), whose sum is σ = 3078505806272. Its totient is φ = 366670666656.
The previous prime is 1100012000099. The next prime is 1100012000119. The reversal of 1100012000112 is 2110002100011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1100012000094 and 1100012000103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100012000119) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3819485968 + ... + 3819486255.
Almost surely, 21100012000112 is an apocalyptic number.
1100012000112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1100012000112 is an abundant number, since it is smaller than the sum of its proper divisors (1978493806160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100012000112 is a wasteful number, since it uses less digits than its factorization.
1100012000112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7638972237 (or 7638972228 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1100012000112 its reverse (2110002100011), we get a palindrome (3210014100123).
The spelling of 1100012000112 in words is "one trillion, one hundred billion, twelve million, one hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •