Base | Representation |
---|---|
bin | 1001000110001101000011010… |
… | …1100111111010011110111101 |
3 | 10002221112210020121112101022112 |
4 | 2101203100311213322132331 |
5 | 1132401023212330230022 |
6 | 10145244131512423405 |
7 | 251556406041033233 |
oct | 22143206547723675 |
9 | 3087483217471275 |
10 | 640140005320637 |
11 | 175a71940651678 |
12 | 5b9675086a7b65 |
13 | 21625c35aaa083 |
14 | b410d2795c953 |
15 | 4e0179d30c8e2 |
hex | 24634359fa7bd |
640140005320637 has 2 divisors, whose sum is σ = 640140005320638. Its totient is φ = 640140005320636.
The previous prime is 640140005320577. The next prime is 640140005320649. The reversal of 640140005320637 is 736023500041046.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 586394992772836 + 53745012547801 = 24215594^2 + 7331099^2 .
It is a cyclic number.
It is not a de Polignac number, because 640140005320637 - 28 = 640140005320381 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 640140005320594 and 640140005320603.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (640140005320537) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 320070002660318 + 320070002660319.
It is an arithmetic number, because the mean of its divisors is an integer number (320070002660319).
Almost surely, 2640140005320637 is an apocalyptic number.
It is an amenable number.
640140005320637 is a deficient number, since it is larger than the sum of its proper divisors (1).
640140005320637 is an equidigital number, since it uses as much as digits as its factorization.
640140005320637 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 362880, while the sum is 41.
The spelling of 640140005320637 in words is "six hundred forty trillion, one hundred forty billion, five million, three hundred twenty thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •