Base | Representation |
---|---|
bin | 100110001011011… |
… | …100010001111111 |
3 | 1122122021110221211 |
4 | 212023130101333 |
5 | 2302434034011 |
6 | 143320505251 |
7 | 21605305663 |
oct | 4613342177 |
9 | 1578243854 |
10 | 640533631 |
11 | 2a9623441 |
12 | 15a61b227 |
13 | a291b2aa |
14 | 610d88a3 |
15 | 3b377b21 |
hex | 262dc47f |
640533631 has 2 divisors, whose sum is σ = 640533632. Its totient is φ = 640533630.
The previous prime is 640533629. The next prime is 640533661. The reversal of 640533631 is 136335046.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 640533631 - 21 = 640533629 is a prime.
It is a super-2 number, since 2×6405336312 = 820566664884088322, which contains 22 as substring.
Together with 640533629, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 640533593 and 640533602.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (640533661) 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, 320266815 + 320266816.
It is an arithmetic number, because the mean of its divisors is an integer number (320266816).
Almost surely, 2640533631 is an apocalyptic number.
640533631 is a deficient number, since it is larger than the sum of its proper divisors (1).
640533631 is an equidigital number, since it uses as much as digits as its factorization.
640533631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 31.
The square root of 640533631 is about 25308.7658924729. The cubic root of 640533631 is about 862.0133247115.
Adding to 640533631 its reverse (136335046), we get a palindrome (776868677).
The spelling of 640533631 in words is "six hundred forty million, five hundred thirty-three thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •