Base | Representation |
---|---|
bin | 100110001110000… |
… | …010000011010111 |
3 | 1122200112222100222 |
4 | 212032002003113 |
5 | 2303122301011 |
6 | 143343224555 |
7 | 21614134403 |
oct | 4616020327 |
9 | 1580488328 |
10 | 641212631 |
11 | 2a9a475a4 |
12 | 15a8a815b |
13 | a2ac8377 |
14 | 61234103 |
15 | 3b45dddb |
hex | 263820d7 |
641212631 has 2 divisors, whose sum is σ = 641212632. Its totient is φ = 641212630.
The previous prime is 641212597. The next prime is 641212633. The reversal of 641212631 is 136212146.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 641212631 - 218 = 640950487 is a prime.
It is a super-2 number, since 2×6412126312 = 822307276307884322, which contains 22 as substring.
Together with 641212633, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 641212631.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (641212633) 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, 320606315 + 320606316.
It is an arithmetic number, because the mean of its divisors is an integer number (320606316).
Almost surely, 2641212631 is an apocalyptic number.
641212631 is a deficient number, since it is larger than the sum of its proper divisors (1).
641212631 is an equidigital number, since it uses as much as digits as its factorization.
641212631 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1728, while the sum is 26.
The square root of 641212631 is about 25322.1766639442. The cubic root of 641212631 is about 862.3178105974.
Adding to 641212631 its reverse (136212146), we get a palindrome (777424777).
The spelling of 641212631 in words is "six hundred forty-one million, two hundred twelve thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •