Base | Representation |
---|---|
bin | 111101100100111101… |
… | …111110101100101010 |
3 | 20022122220120201120000 |
4 | 331210331332230222 |
5 | 2040402312304014 |
6 | 50212512243430 |
7 | 4530322536555 |
oct | 754475765452 |
9 | 208586521500 |
10 | 66118478634 |
11 | 2604a18067a |
12 | 10992b40576 |
13 | 6309239550 |
14 | 32b330369c |
15 | 1abe990509 |
hex | f64f7eb2a |
66118478634 has 160 divisors (see below), whose sum is σ = 164575488000. Its totient is φ = 19711133568.
The previous prime is 66118478617. The next prime is 66118478653. The reversal of 66118478634 is 43687481166.
It is a super-4 number, since 4×661184786344 (a number of 44 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 11497992 + ... + 11503740.
It is an arithmetic number, because the mean of its divisors is an integer number (1028596800).
Almost surely, 266118478634 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 66118478634, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82287744000).
66118478634 is an abundant number, since it is smaller than the sum of its proper divisors (98457009366).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66118478634 is a wasteful number, since it uses less digits than its factorization.
66118478634 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5946 (or 5937 counting only the distinct ones).
The product of its digits is 4644864, while the sum is 54.
The spelling of 66118478634 in words is "sixty-six billion, one hundred eighteen million, four hundred seventy-eight thousand, six hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •