Base | Representation |
---|---|
bin | 11110010000110000100110… |
… | …10001100000010011110000 |
3 | 22201121210021020212002112202 |
4 | 33020120103101200103300 |
5 | 32210244311414440422 |
6 | 353311021140442332 |
7 | 20005554314304350 |
oct | 1710302321402360 |
9 | 281553236762482 |
10 | 66546546640112 |
11 | 1a227260793670 |
12 | 75691bb9a93a8 |
13 | 2b1940a50c446 |
14 | 1260c2757cb60 |
15 | 7a6065c6ab92 |
hex | 3c86134604f0 |
66546546640112 has 160 divisors (see below), whose sum is σ = 170249016651264. Its totient is φ = 24395728896000.
The previous prime is 66546546640109. The next prime is 66546546640151. The reversal of 66546546640112 is 21104664564566.
It is a super-4 number, since 4×665465466401124 (a number of 56 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (56).
It is a congruent number.
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, 80242808 + ... + 81067880.
Almost surely, 266546546640112 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 66546546640112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85124508325632).
66546546640112 is an abundant number, since it is smaller than the sum of its proper divisors (103702470011152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66546546640112 is a wasteful number, since it uses less digits than its factorization.
66546546640112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 828967 (or 828961 counting only the distinct ones).
The product of its (nonzero) digits is 24883200, while the sum is 56.
The spelling of 66546546640112 in words is "sixty-six trillion, five hundred forty-six billion, five hundred forty-six million, six hundred forty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •