Base | Representation |
---|---|
bin | 1001000011101011011… |
… | …11100000010010110111 |
3 | 1002202021222020002210222 |
4 | 10201311233200102313 |
5 | 20044331014021011 |
6 | 354545211204555 |
7 | 31325102062514 |
oct | 4416557402267 |
9 | 1082258202728 |
10 | 311213032631 |
11 | 10aa91709716 |
12 | 5039474675b |
13 | 23468c24567 |
14 | 110c442830b |
15 | 8166ccdddb |
hex | 4875be04b7 |
311213032631 has 2 divisors, whose sum is σ = 311213032632. Its totient is φ = 311213032630.
The previous prime is 311213032619. The next prime is 311213032657. The reversal of 311213032631 is 136230312113.
It is an a-pointer prime, because the next prime (311213032657) can be obtained adding 311213032631 to its sum of digits (26).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 311213032631 - 230 = 310139290807 is a prime.
It is a super-2 number, since 2×3112130326312 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 311213032631.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (311213032661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155606516315 + 155606516316.
It is an arithmetic number, because the mean of its divisors is an integer number (155606516316).
Almost surely, 2311213032631 is an apocalyptic number.
311213032631 is a deficient number, since it is larger than the sum of its proper divisors (1).
311213032631 is an equidigital number, since it uses as much as digits as its factorization.
311213032631 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 311213032631 its reverse (136230312113), we get a palindrome (447443344744).
The spelling of 311213032631 in words is "three hundred eleven billion, two hundred thirteen million, thirty-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •