Base | Representation |
---|---|
bin | 10000001100001110110… |
… | …000000000000000000000 |
3 | 10221100221001222012020000 |
4 | 100030032300000000000 |
5 | 121212143330243400 |
6 | 2211050330120000 |
7 | 143246232620436 |
oct | 20141660000000 |
9 | 3840831865200 |
10 | 1112643993600 |
11 | 399962589587 |
12 | 15b77a280000 |
13 | 80bca49cba9 |
14 | 3bbd0840d56 |
15 | 1de20a2e600 |
hex | 1030ec00000 |
1112643993600 has 690 divisors, whose sum is σ = 4153467761124. Its totient is φ = 294440140800.
The previous prime is 1112643993589. The next prime is 1112643993683. The reversal of 1112643993600 is 63993462111.
1112643993600 is a `hidden beast` number, since 1 + 1 + 1 + 2 + 6 + 4 + 39 + 9 + 3 + 600 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 8493465535 + ... + 8493465665.
Almost surely, 21112643993600 is an apocalyptic number.
1112643993600 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1112643993600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2076733880562).
1112643993600 is an abundant number, since it is smaller than the sum of its proper divisors (3040823767524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112643993600 is an frugal number, since it uses more digits than its factorization.
1112643993600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 197 (or 141 counting only the distinct ones).
The product of its (nonzero) digits is 209952, while the sum is 45.
The spelling of 1112643993600 in words is "one trillion, one hundred twelve billion, six hundred forty-three million, nine hundred ninety-three thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •