Base | Representation |
---|---|
bin | 11110010000101011111101… |
… | …10001100100010110111100 |
3 | 22201121112211121211212021010 |
4 | 33020111332301210112330 |
5 | 32210224211120140444 |
6 | 353305530021235220 |
7 | 20005435502614500 |
oct | 1710257661442674 |
9 | 281545747755233 |
10 | 66544055240124 |
11 | 1a2261a2423a10 |
12 | 7568825562b10 |
13 | 2b19101301577 |
14 | 1260a6c72a300 |
15 | 7a5e6c18d2b9 |
hex | 3c857ec645bc |
66544055240124 has 288 divisors, whose sum is σ = 201941381843712. Its totient is φ = 16854585216000.
The previous prime is 66544055240111. The next prime is 66544055240153. The reversal of 66544055240124 is 42104255044566.
It is a super-2 number, since 2×665440552401242 (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 95 ways as a sum of consecutive naturals, for example, 567708907 + ... + 567826109.
It is an arithmetic number, because the mean of its divisors is an integer number (701185353624).
Almost surely, 266544055240124 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 66544055240124, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100970690921856).
66544055240124 is an abundant number, since it is smaller than the sum of its proper divisors (135397326603588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66544055240124 is a wasteful number, since it uses less digits than its factorization.
66544055240124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119417 (or 119408 counting only the distinct ones).
The product of its (nonzero) digits is 4608000, while the sum is 48.
The spelling of 66544055240124 in words is "sixty-six trillion, five hundred forty-four billion, fifty-five million, two hundred forty thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •