Base | Representation |
---|---|
bin | 10001100000001111010… |
… | …11101000100001101000 |
3 | 2010111101021220222222010 |
4 | 20300013223220201220 |
5 | 34323204110101021 |
6 | 1140142425555520 |
7 | 61310566126362 |
oct | 10600753504150 |
9 | 2114337828863 |
10 | 601424300136 |
11 | 21207637a350 |
12 | 98687945ba0 |
13 | 44938a6675a |
14 | 211754bdd32 |
15 | 1099ee12976 |
hex | 8c07ae8868 |
601424300136 has 128 divisors (see below), whose sum is σ = 1745463168000. Its totient is φ = 170667002880.
The previous prime is 601424300083. The next prime is 601424300167. The reversal of 601424300136 is 631003424106.
It is a super-2 number, since 2×6014243001362 (a number of 24 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 556411 + ... + 1229813.
It is an arithmetic number, because the mean of its divisors is an integer number (13636431000).
Almost surely, 2601424300136 is an apocalyptic number.
601424300136 is a gapful number since it is divisible by the number (66) 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 601424300136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (872731584000).
601424300136 is an abundant number, since it is smaller than the sum of its proper divisors (1144038867864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
601424300136 is a wasteful number, since it uses less digits than its factorization.
601424300136 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 673639 (or 673635 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 30.
The spelling of 601424300136 in words is "six hundred one billion, four hundred twenty-four million, three hundred thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •