Base | Representation |
---|---|
bin | 11110001001100011101100… |
… | …01101011011110000000000 |
3 | 22200202010120011100210020110 |
4 | 33010301312031123300000 |
5 | 32142221023143222310 |
6 | 353001215122311320 |
7 | 16651644315140010 |
oct | 1704616615336000 |
9 | 280663504323213 |
10 | 66299098414080 |
11 | 1a141320705a24 |
12 | 7529261ab8540 |
13 | 2acbc9400969c |
14 | 1252c71a17c40 |
15 | 79e8d1ea7d20 |
hex | 3c4c7635bc00 |
66299098414080 has 704 divisors, whose sum is σ = 255728926080000. Its totient is φ = 14321214554112.
The previous prime is 66299098414079. The next prime is 66299098414117. The reversal of 66299098414080 is 8041489099266.
It is a super-2 number, since 2×662990984140802 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
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, 835498246 + ... + 835577594.
Almost surely, 266299098414080 is an apocalyptic number.
66299098414080 is a gapful number since it is divisible by the number (60) 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 66299098414080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127864463040000).
66299098414080 is an abundant number, since it is smaller than the sum of its proper divisors (189429827665920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66299098414080 is a wasteful number, since it uses less digits than its factorization.
66299098414080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79812 (or 79794 counting only the distinct ones).
The product of its (nonzero) digits is 53747712, while the sum is 66.
The spelling of 66299098414080 in words is "sixty-six trillion, two hundred ninety-nine billion, ninety-eight million, four hundred fourteen thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •