Base | Representation |
---|---|
bin | 1001000110100100101000111… |
… | …1100111110111110101100101 |
3 | 10002222222112020021012000202222 |
4 | 2101221022033213313311211 |
5 | 1132424143123444410221 |
6 | 10150154231045042125 |
7 | 251630603142404453 |
oct | 22151121747676545 |
9 | 3088875207160688 |
10 | 640545242185061 |
11 | 1761087912627a4 |
12 | 5ba11b616b6345 |
13 | 2165520736a855 |
14 | b4267ab43d9d3 |
15 | 4e0c0b98499ab |
hex | 246928f9f7d65 |
640545242185061 has 2 divisors, whose sum is σ = 640545242185062. Its totient is φ = 640545242185060.
The previous prime is 640545242185039. The next prime is 640545242185067. The reversal of 640545242185061 is 160581242545046.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 639700692213025 + 844549972036 = 25292305^2 + 918994^2 .
It is a cyclic number.
It is not a de Polignac number, because 640545242185061 - 26 = 640545242184997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 640545242184994 and 640545242185012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (640545242185067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 320272621092530 + 320272621092531.
It is an arithmetic number, because the mean of its divisors is an integer number (320272621092531).
Almost surely, 2640545242185061 is an apocalyptic number.
It is an amenable number.
640545242185061 is a deficient number, since it is larger than the sum of its proper divisors (1).
640545242185061 is an equidigital number, since it uses as much as digits as its factorization.
640545242185061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9216000, while the sum is 53.
The spelling of 640545242185061 in words is "six hundred forty trillion, five hundred forty-five billion, two hundred forty-two million, one hundred eighty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •