Base | Representation |
---|---|
bin | 10010101001010001010… |
… | …10011001100110011101 |
3 | 2021020120202202022120112 |
4 | 21110220222121212131 |
5 | 40444003334040103 |
6 | 1210145154055405 |
7 | 64166315651300 |
oct | 11245052314635 |
9 | 2236522668515 |
10 | 640632330653 |
11 | 227766281a57 |
12 | a41aa57a565 |
13 | 48546a18403 |
14 | 23014812b37 |
15 | 119e710bcd8 |
hex | 9528a9999d |
640632330653 has 24 divisors (see below), whose sum is σ = 784511200800. Its totient is φ = 520170644448.
The previous prime is 640632330589. The next prime is 640632330661. The reversal of 640632330653 is 356033236046.
It is not a de Polignac number, because 640632330653 - 26 = 640632330589 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 640632330653.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (640632336653) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17241251 + ... + 17278367.
It is an arithmetic number, because the mean of its divisors is an integer number (32687966700).
Almost surely, 2640632330653 is an apocalyptic number.
It is an amenable number.
640632330653 is a deficient number, since it is larger than the sum of its proper divisors (143878870147).
640632330653 is a wasteful number, since it uses less digits than its factorization.
640632330653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55689 (or 55682 counting only the distinct ones).
The product of its (nonzero) digits is 699840, while the sum is 41.
Adding to 640632330653 its reverse (356033236046), we get a palindrome (996665566699).
The spelling of 640632330653 in words is "six hundred forty billion, six hundred thirty-two million, three hundred thirty thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •