Base | Representation |
---|---|
bin | 100111100100111… |
… | …110100110000001 |
3 | 1201021102221121112 |
4 | 213210332212001 |
5 | 2324441124433 |
6 | 145515533105 |
7 | 22311643421 |
oct | 4744764601 |
9 | 1637387545 |
10 | 664004993 |
11 | 3108a4863 |
12 | 16645a195 |
13 | a7748782 |
14 | 64288481 |
15 | 3d462348 |
hex | 2793e981 |
664004993 has 4 divisors (see below), whose sum is σ = 673357248. Its totient is φ = 654652740.
The previous prime is 664004977. The next prime is 664005019. The reversal of 664004993 is 399400466.
664004993 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 664004993 - 24 = 664004977 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 664004993.
It is not an unprimeable number, because it can be changed into a prime (664004953) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4676021 + ... + 4676162.
It is an arithmetic number, because the mean of its divisors is an integer number (168339312).
Almost surely, 2664004993 is an apocalyptic number.
It is an amenable number.
664004993 is a deficient number, since it is larger than the sum of its proper divisors (9352255).
664004993 is an equidigital number, since it uses as much as digits as its factorization.
664004993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9352254.
The product of its (nonzero) digits is 139968, while the sum is 41.
The square root of 664004993 is about 25768.2943362575. The cubic root of 664004993 is about 872.4163210143.
The spelling of 664004993 in words is "six hundred sixty-four million, four thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •