Base | Representation |
---|---|
bin | 111110010100101001… |
… | …000111101010000101 |
3 | 20101201122121201002020 |
4 | 332110221013222011 |
5 | 2044022042113202 |
6 | 50424123433353 |
7 | 4556204210112 |
oct | 762451075205 |
9 | 211648551066 |
10 | 66918316677 |
11 | 2641a710853 |
12 | 10b76985859 |
13 | 6405b637b4 |
14 | 334b629909 |
15 | 1b19cd45bc |
hex | f94a47a85 |
66918316677 has 8 divisors (see below), whose sum is σ = 89227138464. Its totient is φ = 44610853008.
The previous prime is 66918316649. The next prime is 66918316679. The reversal of 66918316677 is 77661381966.
66918316677 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 66918316677 - 26 = 66918316613 is a prime.
It is a super-2 number, since 2×669183166772 (a number of 22 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 66918316677.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66918316679) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 218383 + ... + 426060.
It is an arithmetic number, because the mean of its divisors is an integer number (11153392308).
Almost surely, 266918316677 is an apocalyptic number.
It is an amenable number.
66918316677 is a deficient number, since it is larger than the sum of its proper divisors (22308821787).
66918316677 is a wasteful number, since it uses less digits than its factorization.
66918316677 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 679059.
The product of its digits is 13716864, while the sum is 60.
The spelling of 66918316677 in words is "sixty-six billion, nine hundred eighteen million, three hundred sixteen thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •