Base | Representation |
---|---|
bin | 1001001100101101111101… |
… | …1011111110001010110000 |
3 | 1022210220021010122110211210 |
4 | 2103023133123332022300 |
5 | 2311202140011311410 |
6 | 33302204255440120 |
7 | 2062501603454130 |
oct | 223133733761260 |
9 | 38726233573753 |
10 | 10114101666480 |
11 | 324a403797939 |
12 | 1174220226040 |
13 | 5849a9351cc6 |
14 | 26d74cd6cac0 |
15 | 128157194220 |
hex | 932df6fe2b0 |
10114101666480 has 320 divisors, whose sum is σ = 37334424158208. Its totient is φ = 2216310819840.
The previous prime is 10114101666457. The next prime is 10114101666503. The reversal of 10114101666480 is 8466610141101.
It is an interprime number because it is at equal distance from previous prime (10114101666457) and next prime (10114101666503).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4665069 + ... + 6480051.
Almost surely, 210114101666480 is an apocalyptic number.
10114101666480 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 10114101666480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18667212079104).
10114101666480 is an abundant number, since it is smaller than the sum of its proper divisors (27220322491728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10114101666480 is a wasteful number, since it uses less digits than its factorization.
10114101666480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1815144 (or 1815138 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 39.
The spelling of 10114101666480 in words is "ten trillion, one hundred fourteen billion, one hundred one million, six hundred sixty-six thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •