Base | Representation |
---|---|
bin | 10010101000001001001… |
… | …10000000101100100001 |
3 | 2021012000121002111202211 |
4 | 21110010212000230201 |
5 | 40441233430402124 |
6 | 1210005140042121 |
7 | 64145320303651 |
oct | 11240446005441 |
9 | 2235017074684 |
10 | 640027200289 |
11 | 22748573a614 |
12 | a405b993341 |
13 | 4847b5445c9 |
14 | 22d982d2361 |
15 | 119ade28e94 |
hex | 9504980b21 |
640027200289 has 27 divisors (see below), whose sum is σ = 669826214643. Its totient is φ = 611532994800.
The previous prime is 640027200259. The next prime is 640027200353. The reversal of 640027200289 is 982002720046.
The square root of 640027200289 is 800017.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 627097691025 + 12929509264 = 791895^2 + 113708^2 .
It is not a de Polignac number, because 640027200289 - 25 = 640027200257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (640027200259) 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 in 26 ways as a sum of consecutive naturals, for example, 3248868939 + ... + 3248869135.
Almost surely, 2640027200289 is an apocalyptic number.
640027200289 is the 800017-th square number.
640027200289 is the 400009-th centered octagonal number.
It is an amenable number.
640027200289 is a deficient number, since it is larger than the sum of its proper divisors (29799014354).
640027200289 is an frugal number, since it uses more digits than its factorization.
640027200289 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 718 (or 359 counting only the distinct ones).
The product of its (nonzero) digits is 96768, while the sum is 40.
The spelling of 640027200289 in words is "six hundred forty billion, twenty-seven million, two hundred thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.285 sec. • engine limits •