Base | Representation |
---|---|
bin | 100111101000010… |
… | …011001001001001 |
3 | 1201100002011211222 |
4 | 213220103021021 |
5 | 2330202004333 |
6 | 145550331425 |
7 | 22322230544 |
oct | 4750231111 |
9 | 1640064758 |
10 | 664875593 |
11 | 311339968 |
12 | 1667b9b75 |
13 | a7991b15 |
14 | 6443385b |
15 | 3d585298 |
hex | 27a13249 |
664875593 has 4 divisors (see below), whose sum is σ = 703985940. Its totient is φ = 625765248.
The previous prime is 664875587. The next prime is 664875647. The reversal of 664875593 is 395578466.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 395578466 = 2 ⋅197789233.
It can be written as a sum of positive squares in 2 ways, for example, as 409131529 + 255744064 = 20227^2 + 15992^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-664875593 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (664875553) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 19555148 + ... + 19555181.
It is an arithmetic number, because the mean of its divisors is an integer number (175996485).
Almost surely, 2664875593 is an apocalyptic number.
It is an amenable number.
664875593 is a deficient number, since it is larger than the sum of its proper divisors (39110347).
664875593 is a wasteful number, since it uses less digits than its factorization.
664875593 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39110346.
The product of its digits is 5443200, while the sum is 53.
The square root of 664875593 is about 25785.1816553617. The cubic root of 664875593 is about 872.7974396062.
The spelling of 664875593 in words is "six hundred sixty-four million, eight hundred seventy-five thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •