Base | Representation |
---|---|
bin | 111101100011000011… |
… | …111001101100001010 |
3 | 20022120200100211221210 |
4 | 331203003321230022 |
5 | 2040321114222204 |
6 | 50205410313550 |
7 | 4526453532210 |
oct | 754303715412 |
9 | 208520324853 |
10 | 66086476554 |
11 | 26033102a7a |
12 | 109842888b6 |
13 | 63027131c7 |
14 | 32acd72cb0 |
15 | 1abbc6d389 |
hex | f630f9b0a |
66086476554 has 64 divisors (see below), whose sum is σ = 154039366656. Its totient is φ = 18512423424.
The previous prime is 66086476523. The next prime is 66086476559. The reversal of 66086476554 is 45567468066.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 66086476494 and 66086476503.
It is not an unprimeable number, because it can be changed into a prime (66086476559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 360117 + ... + 511719.
It is an arithmetic number, because the mean of its divisors is an integer number (2406865104).
Almost surely, 266086476554 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 66086476554, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77019683328).
66086476554 is an abundant number, since it is smaller than the sum of its proper divisors (87952890102).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66086476554 is a wasteful number, since it uses less digits than its factorization.
66086476554 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151819.
The product of its (nonzero) digits is 29030400, while the sum is 57.
The spelling of 66086476554 in words is "sixty-six billion, eighty-six million, four hundred seventy-six thousand, five hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •