Base | Representation |
---|---|
bin | 10011010101001001111… |
… | …00000011110011001101 |
3 | 2100111101200202020000221 |
4 | 21222210330003303031 |
5 | 41340231143434323 |
6 | 1225043051151341 |
7 | 65662205206144 |
oct | 11524474036315 |
9 | 2314350666027 |
10 | 664192171213 |
11 | 23675618a96a |
12 | a8884745551 |
13 | 4a82ca81b7c |
14 | 2420b7d275b |
15 | 1242565555d |
hex | 9aa4f03ccd |
664192171213 has 2 divisors, whose sum is σ = 664192171214. Its totient is φ = 664192171212.
The previous prime is 664192171147. The next prime is 664192171217. The reversal of 664192171213 is 312171291466.
It is a happy number.
664192171213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 602528355529 + 61663815684 = 776227^2 + 248322^2 .
It is a cyclic number.
It is not a de Polignac number, because 664192171213 - 213 = 664192163021 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 664192171213.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (664192171217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 332096085606 + 332096085607.
It is an arithmetic number, because the mean of its divisors is an integer number (332096085607).
Almost surely, 2664192171213 is an apocalyptic number.
It is an amenable number.
664192171213 is a deficient number, since it is larger than the sum of its proper divisors (1).
664192171213 is an equidigital number, since it uses as much as digits as its factorization.
664192171213 is an evil number, because the sum of its binary digits is even.
The product of its digits is 108864, while the sum is 43.
The spelling of 664192171213 in words is "six hundred sixty-four billion, one hundred ninety-two million, one hundred seventy-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •