Base | Representation |
---|---|
bin | 1001001100110101011101… |
… | …1100110101101111000000 |
3 | 1022211002110110101112200212 |
4 | 2103031113130311233000 |
5 | 2311220300440110000 |
6 | 33303140143533252 |
7 | 2062602523045463 |
oct | 223152734655700 |
9 | 38732413345625 |
10 | 10116115160000 |
11 | 3250247310373 |
12 | 11746a25ba228 |
13 | 584c3a5420a5 |
14 | 26d8a053b2da |
15 | 128223d1ec35 |
hex | 93357735bc0 |
10116115160000 has 140 divisors (see below), whose sum is σ = 25428310923312. Its totient is φ = 3991014144000.
The previous prime is 10116115159993. The next prime is 10116115160089. The reversal of 10116115160000 is 6151161101.
It is a happy number.
It is a congruent number.
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 19 ways as a sum of consecutive naturals, for example, 1187789 + ... + 4652211.
Almost surely, 210116115160000 is an apocalyptic number.
10116115160000 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 10116115160000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12714155461656).
10116115160000 is an abundant number, since it is smaller than the sum of its proper divisors (15312195763312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10116115160000 is an frugal number, since it uses more digits than its factorization.
10116115160000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3464528 (or 3464503 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 23.
The spelling of 10116115160000 in words is "ten trillion, one hundred sixteen billion, one hundred fifteen million, one hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •