Base | Representation |
---|---|
bin | 110001100111000… |
… | …1010000001100000 |
3 | 11022000100020222210 |
4 | 1203032022001200 |
5 | 11402122433311 |
6 | 433103202120 |
7 | 56152223622 |
oct | 14316120140 |
9 | 4260306883 |
10 | 1664655456 |
11 | 784722312 |
12 | 3a55a6340 |
13 | 206b52a39 |
14 | 11b124c12 |
15 | 9b2213a6 |
hex | 6338a060 |
1664655456 has 48 divisors (see below), whose sum is σ = 4487830704. Its totient is φ = 539887104.
The previous prime is 1664655439. The next prime is 1664655469. The reversal of 1664655456 is 6545564661.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 230775 + ... + 237878.
It is an arithmetic number, because the mean of its divisors is an integer number (93496473).
Almost surely, 21664655456 is an apocalyptic number.
1664655456 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1664655456 is an abundant number, since it is smaller than the sum of its proper divisors (2823175248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1664655456 is a wasteful number, since it uses less digits than its factorization.
1664655456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 468703 (or 468695 counting only the distinct ones).
The product of its digits is 2592000, while the sum is 48.
The square root of 1664655456 is about 40800.1894113250. The cubic root of 1664655456 is about 1185.1539987508.
The spelling of 1664655456 in words is "one billion, six hundred sixty-four million, six hundred fifty-five thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •