Base | Representation |
---|---|
bin | 10010101000100011111… |
… | …00010010000011011001 |
3 | 2021012121012110221112122 |
4 | 21110101330102003121 |
5 | 40442213243023421 |
6 | 1210043255551025 |
7 | 64154006626205 |
oct | 11242174220331 |
9 | 2235535427478 |
10 | 640251142361 |
11 | 227590095606 |
12 | a410298b475 |
13 | 484b5a623cc |
14 | 22db9d47b05 |
15 | 119c39122ab |
hex | 9511f120d9 |
640251142361 has 8 divisors (see below), whose sum is σ = 655889578848. Its totient is φ = 624613780000.
The previous prime is 640251142339. The next prime is 640251142463. The reversal of 640251142361 is 163241152046.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 640251142361 - 222 = 640246948057 is a prime.
It is a super-3 number, since 3×6402511423613 (a number of 36 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (640251144361) 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 in 7 ways as a sum of consecutive naturals, for example, 1011806 + ... + 1517976.
It is an arithmetic number, because the mean of its divisors is an integer number (81986197356).
Almost surely, 2640251142361 is an apocalyptic number.
It is an amenable number.
640251142361 is a deficient number, since it is larger than the sum of its proper divisors (15638436487).
640251142361 is a wasteful number, since it uses less digits than its factorization.
640251142361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 537063.
The product of its (nonzero) digits is 34560, while the sum is 35.
The spelling of 640251142361 in words is "six hundred forty billion, two hundred fifty-one million, one hundred forty-two thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •