Base | Representation |
---|---|
bin | 110001100101111… |
… | …0110011101101000 |
3 | 11021222012112220022 |
4 | 1203023312131220 |
5 | 11401444113143 |
6 | 433042220012 |
7 | 56144125532 |
oct | 14313663550 |
9 | 4258175808 |
10 | 1664051048 |
11 | 78434a200 |
12 | 3a5354608 |
13 | 2069a08ba |
14 | 11b008852 |
15 | 9b152268 |
hex | 632f6768 |
1664051048 has 48 divisors (see below), whose sum is σ = 3434935140. Its totient is φ = 755194880.
The previous prime is 1664051029. The next prime is 1664051057. The reversal of 1664051048 is 8401504661.
It can be written as a sum of positive squares in 2 ways, for example, as 1654699684 + 9351364 = 40678^2 + 3058^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1664050999 and 1664051017.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 979736 + ... + 981432.
Almost surely, 21664051048 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 1664051048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1717467570).
1664051048 is an abundant number, since it is smaller than the sum of its proper divisors (1770884092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1664051048 is a wasteful number, since it uses less digits than its factorization.
1664051048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2738 (or 2723 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 35.
The square root of 1664051048 is about 40792.7818124727. The cubic root of 1664051048 is about 1185.0105449874.
The spelling of 1664051048 in words is "one billion, six hundred sixty-four million, fifty-one thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •