Base | Representation |
---|---|
bin | 100111100101111… |
… | …000001100011001 |
3 | 1201021212221020121 |
4 | 213211320030121 |
5 | 2330021202141 |
6 | 145524553241 |
7 | 22313645311 |
oct | 4745701431 |
9 | 1637787217 |
10 | 664240921 |
11 | 310a46043 |
12 | 166552821 |
13 | a77cbc86 |
14 | 6430a441 |
15 | 3d4ac1d1 |
hex | 27978319 |
664240921 has 2 divisors, whose sum is σ = 664240922. Its totient is φ = 664240920.
The previous prime is 664240919. The next prime is 664240979. The reversal of 664240921 is 129042466.
664240921 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 496175625 + 168065296 = 22275^2 + 12964^2 .
It is a cyclic number.
It is not a de Polignac number, because 664240921 - 21 = 664240919 is a prime.
It is a super-5 number, since 5×6642409215 (a number of 45 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
Together with 664240919, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (664240901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 332120460 + 332120461.
It is an arithmetic number, because the mean of its divisors is an integer number (332120461).
Almost surely, 2664240921 is an apocalyptic number.
It is an amenable number.
664240921 is a deficient number, since it is larger than the sum of its proper divisors (1).
664240921 is an equidigital number, since it uses as much as digits as its factorization.
664240921 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 34.
The square root of 664240921 is about 25772.8718035069. The cubic root of 664240921 is about 872.5196350291.
The spelling of 664240921 in words is "six hundred sixty-four million, two hundred forty thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •