Base | Representation |
---|---|
bin | 100110001010001… |
… | …110011000101001 |
3 | 1122121200021021201 |
4 | 212022032120221 |
5 | 2302343331234 |
6 | 143310004201 |
7 | 21602506531 |
oct | 4612163051 |
9 | 1577607251 |
10 | 640214569 |
11 | 2a9425755 |
12 | 15a4a6661 |
13 | a2838cb7 |
14 | 610544c1 |
15 | 3b313314 |
hex | 2628e629 |
640214569 has 2 divisors, whose sum is σ = 640214570. Its totient is φ = 640214568.
The previous prime is 640214551. The next prime is 640214579. The reversal of 640214569 is 965412046.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 518928400 + 121286169 = 22780^2 + 11013^2 .
It is a cyclic number.
It is not a de Polignac number, because 640214569 - 25 = 640214537 is a prime.
It is a super-2 number, since 2×6402145692 = 819749388719711522, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (640214539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 320107284 + 320107285.
It is an arithmetic number, because the mean of its divisors is an integer number (320107285).
Almost surely, 2640214569 is an apocalyptic number.
It is an amenable number.
640214569 is a deficient number, since it is larger than the sum of its proper divisors (1).
640214569 is an equidigital number, since it uses as much as digits as its factorization.
640214569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 37.
The square root of 640214569 is about 25302.4617181807. The cubic root of 640214569 is about 861.8701725222.
The spelling of 640214569 in words is "six hundred forty million, two hundred fourteen thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •