Base | Representation |
---|---|
bin | 1001011100010100011010011… |
… | …0001111111100011001100101 |
3 | 10020010122100022111210222212211 |
4 | 2113011012212033330121211 |
5 | 1144042420240402200333 |
6 | 10313102423050443421 |
7 | 256646224532534251 |
oct | 22705064617743145 |
9 | 3203570274728784 |
10 | 664455704725093 |
11 | 182797099aa14a6 |
12 | 62633b73133571 |
13 | 2269ab9a3c5468 |
14 | ba11b83303261 |
15 | 51c403ec27ecd |
hex | 25c51a63fc665 |
664455704725093 has 2 divisors, whose sum is σ = 664455704725094. Its totient is φ = 664455704725092.
The previous prime is 664455704725081. The next prime is 664455704725151. The reversal of 664455704725093 is 390527407554466.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 644032834351204 + 20422870373889 = 25377802^2 + 4519167^2 .
It is a cyclic number.
It is not a de Polignac number, because 664455704725093 - 237 = 664318265771621 is a prime.
It is a super-3 number, since 3×6644557047250933 (a number of 45 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (664455704725063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 332227852362546 + 332227852362547.
It is an arithmetic number, because the mean of its divisors is an integer number (332227852362547).
Almost surely, 2664455704725093 is an apocalyptic number.
It is an amenable number.
664455704725093 is a deficient number, since it is larger than the sum of its proper divisors (1).
664455704725093 is an equidigital number, since it uses as much as digits as its factorization.
664455704725093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 762048000, while the sum is 67.
The spelling of 664455704725093 in words is "six hundred sixty-four trillion, four hundred fifty-five billion, seven hundred four million, seven hundred twenty-five thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •