Base | Representation |
---|---|
bin | 10010101000111100001… |
… | …00000011010101110001 |
3 | 2021020010101010212210101 |
4 | 21110132010003111301 |
5 | 40443122323141331 |
6 | 1210115402432401 |
7 | 64162026322513 |
oct | 11243604032561 |
9 | 2236111125711 |
10 | 640454505841 |
11 | 2276849655a7 |
12 | a415ab02701 |
13 | 48518c26627 |
14 | 22dd8d63bb3 |
15 | 119d66d3061 |
hex | 951e103571 |
640454505841 has 2 divisors, whose sum is σ = 640454505842. Its totient is φ = 640454505840.
The previous prime is 640454505797. The next prime is 640454505869. The reversal of 640454505841 is 148505454046.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 600346032400 + 40108473441 = 774820^2 + 200271^2 .
It is a cyclic number.
It is not a de Polignac number, because 640454505841 - 229 = 639917634929 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 640454505791 and 640454505800.
It is not a weakly prime, because it can be changed into another prime (640454505881) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 320227252920 + 320227252921.
It is an arithmetic number, because the mean of its divisors is an integer number (320227252921).
Almost surely, 2640454505841 is an apocalyptic number.
It is an amenable number.
640454505841 is a deficient number, since it is larger than the sum of its proper divisors (1).
640454505841 is an equidigital number, since it uses as much as digits as its factorization.
640454505841 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536000, while the sum is 46.
Adding to 640454505841 its reverse (148505454046), we get a palindrome (788959959887).
The spelling of 640454505841 in words is "six hundred forty billion, four hundred fifty-four million, five hundred five thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •