Base | Representation |
---|---|
bin | 110001101010100… |
… | …1110100000110000 |
3 | 11022010211102100221 |
4 | 1203111032200300 |
5 | 11403111240343 |
6 | 433211022424 |
7 | 56204043244 |
oct | 14325164060 |
9 | 4263742327 |
10 | 1666508848 |
11 | 785778844 |
12 | 3a613aa14 |
13 | 207351514 |
14 | 11b488424 |
15 | 9b48a5ed |
hex | 6354e830 |
1666508848 has 60 divisors (see below), whose sum is σ = 3440308080. Its totient is φ = 781861248.
The previous prime is 1666508821. The next prime is 1666508863. The reversal of 1666508848 is 8488056661.
It is a junction number, because it is equal to n+sod(n) for n = 1666508795 and 1666508804.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 628261 + ... + 630907.
It is an arithmetic number, because the mean of its divisors is an integer number (57338468).
Almost surely, 21666508848 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 1666508848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1720154040).
1666508848 is an abundant number, since it is smaller than the sum of its proper divisors (1773799232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1666508848 is a wasteful number, since it uses less digits than its factorization.
1666508848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2802 (or 2777 counting only the distinct ones).
The product of its (nonzero) digits is 2211840, while the sum is 52.
The square root of 1666508848 is about 40822.8961246014. The cubic root of 1666508848 is about 1185.5936773715.
The spelling of 1666508848 in words is "one billion, six hundred sixty-six million, five hundred eight thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •