Base | Representation |
---|---|
bin | 100111100100111… |
… | …110010110100000 |
3 | 1201021102220020202 |
4 | 213210332112200 |
5 | 2324441112000 |
6 | 145515524332 |
7 | 22311640502 |
oct | 4744762640 |
9 | 1637386222 |
10 | 664004000 |
11 | 3108a4040 |
12 | 1664596a8 |
13 | a774819a |
14 | 64287d72 |
15 | 3d461dd5 |
hex | 2793e5a0 |
664004000 has 96 divisors (see below), whose sum is σ = 1779890112. Its totient is φ = 241440000.
The previous prime is 664003993. The next prime is 664004017. The reversal of 664004000 is 400466.
664004000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36455 + ... + 51545.
It is an arithmetic number, because the mean of its divisors is an integer number (18540522).
Almost surely, 2664004000 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 664004000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (889945056).
664004000 is an abundant number, since it is smaller than the sum of its proper divisors (1115886112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
664004000 is a wasteful number, since it uses less digits than its factorization.
664004000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15127 (or 15109 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 664004000 is about 25768.2750683859. The cubic root of 664004000 is about 872.4158861231.
Adding to 664004000 its reverse (400466), we get a palindrome (664404466).
The spelling of 664004000 in words is "six hundred sixty-four million, four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •