Base | Representation |
---|---|
bin | 100111010110010… |
… | …000100111100100 |
3 | 1201000011220222022 |
4 | 213112100213210 |
5 | 2322444143120 |
6 | 145301122312 |
7 | 22234103555 |
oct | 4726204744 |
9 | 1630156868 |
10 | 660146660 |
11 | 3096a9a58 |
12 | 1650b9398 |
13 | a69c7534 |
14 | 6396232c |
15 | 3ce4e025 |
hex | 275909e4 |
660146660 has 24 divisors (see below), whose sum is σ = 1388439360. Its totient is φ = 263652704.
The previous prime is 660146629. The next prime is 660146687. The reversal of 660146660 is 66641066.
It is a super-2 number, since 2×6601466602 = 871587225418311200, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 660146660.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11864 + ... + 38223.
It is an arithmetic number, because the mean of its divisors is an integer number (57851640).
Almost surely, 2660146660 is an apocalyptic number.
It is an amenable number.
660146660 is an abundant number, since it is smaller than the sum of its proper divisors (728292700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
660146660 is a wasteful number, since it uses less digits than its factorization.
With its successor (660146661) it forms a Ruth-Aaron pair, since the sum of their distinct prime factors is the same (50753).
With its successor (660146661) it forms an eRAP, since the sums of their prime factors are consecutive (50755 and 50756).
660146660 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50755 (or 50753 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 35.
The square root of 660146660 is about 25693.3193651579. The cubic root of 660146660 is about 870.7232546518.
The spelling of 660146660 in words is "six hundred sixty million, one hundred forty-six thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •