| Base | Representation |
|---|---|
| bin | 1001001100011110101110… |
| … | …1111101101011010000000 |
| 3 | 1022210111201012110212012100 |
| 4 | 2103013223233231122000 |
| 5 | 2311120301334400000 |
| 6 | 33300250445430400 |
| 7 | 2062265360202600 |
| oct | 223075357553200 |
| 9 | 38714635425170 |
| 10 | 10110013200000 |
| 11 | 32486a597a51a |
| 12 | 117347ab6b400 |
| 13 | 5844a72c767c |
| 14 | 26d481d8ac00 |
| 15 | 127eb8296a00 |
| hex | 931ebbed680 |
10110013200000 has 1728 divisors, whose sum is σ = 43471629747000. Its totient is φ = 2246952960000.
The previous prime is 10110013199999. The next prime is 10110013200013. The reversal of 10110013200000 is 231001101.
It can be written as a sum of positive squares in 12 ways, for example, as 3244062072384 + 6865951127616 = 1801128^2 + 2620296^2 .
It is a super-3 number, since 3×101100132000003 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 215 ways as a sum of consecutive naturals, for example, 6526799226 + ... + 6526800774.
Almost surely, 210110013200000 is an apocalyptic number.
10110013200000 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 10110013200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21735814873500).
10110013200000 is an abundant number, since it is smaller than the sum of its proper divisors (33361616547000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110013200000 is an equidigital number, since it uses as much as digits as its factorization.
10110013200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1645 (or 1603 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 10110013200000 its reverse (231001101), we get a palindrome (10110244201101).
The spelling of 10110013200000 in words is "ten trillion, one hundred ten billion, thirteen million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •