Base | Representation |
---|---|
bin | 10001100001010011100… |
… | …11101110010000000000 |
3 | 2010112212012021100100110 |
4 | 20300221303232100000 |
5 | 34330342143033310 |
6 | 1140315321351320 |
7 | 61331020522500 |
oct | 10605163562000 |
9 | 2115765240313 |
10 | 601996846080 |
11 | 21233a586613 |
12 | 98807638540 |
13 | 449ca56c136 |
14 | 211cb55ba00 |
15 | 109d530ad20 |
hex | 8c29cee400 |
601996846080 has 528 divisors, whose sum is σ = 2255067167616. Its totient is φ = 136662220800.
The previous prime is 601996845997. The next prime is 601996846097. The reversal of 601996846080 is 80648699106.
It is a super-2 number, since 2×6019968460802 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 601996846080.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 113645992 + ... + 113651288.
Almost surely, 2601996846080 is an apocalyptic number.
601996846080 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 601996846080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1127533583808).
601996846080 is an abundant number, since it is smaller than the sum of its proper divisors (1653070321536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
601996846080 is a wasteful number, since it uses less digits than its factorization.
601996846080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5490 (or 5465 counting only the distinct ones).
The product of its (nonzero) digits is 4478976, while the sum is 57.
The spelling of 601996846080 in words is "six hundred one billion, nine hundred ninety-six million, eight hundred forty-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •