Base | Representation |
---|---|
bin | 1001011100011011001000000… |
… | …1100000111011001001000101 |
3 | 10020011001101001022001221012221 |
4 | 2113012302001200323021011 |
5 | 1144101313003422131024 |
6 | 10313231420554412341 |
7 | 256660450132002265 |
oct | 22706620140731105 |
9 | 3204041038057187 |
10 | 664571052536389 |
11 | 182831000909369 |
12 | 626523a4a310b1 |
13 | 226a8a2081bb3b |
14 | ba175a68457a5 |
15 | 51c704157c3e4 |
hex | 25c6c8183b245 |
664571052536389 has 2 divisors, whose sum is σ = 664571052536390. Its totient is φ = 664571052536388.
The previous prime is 664571052536359. The next prime is 664571052536543. The reversal of 664571052536389 is 983635250175466.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 531742154416225 + 132828898120164 = 23059535^2 + 11525142^2 .
It is a cyclic number.
It is not a de Polignac number, because 664571052536389 - 29 = 664571052535877 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (664571052536359) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 332285526268194 + 332285526268195.
It is an arithmetic number, because the mean of its divisors is an integer number (332285526268195).
It is a 1-persistent number, because it is pandigital, but 2⋅664571052536389 = 1329142105072778 is not.
Almost surely, 2664571052536389 is an apocalyptic number.
It is an amenable number.
664571052536389 is a deficient number, since it is larger than the sum of its proper divisors (1).
664571052536389 is an equidigital number, since it uses as much as digits as its factorization.
664571052536389 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 979776000, while the sum is 70.
The spelling of 664571052536389 in words is "six hundred sixty-four trillion, five hundred seventy-one billion, fifty-two million, five hundred thirty-six thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •