Base | Representation |
---|---|
bin | 11101000110001100… |
… | …011000111110100111 |
3 | 2222122100010121000101 |
4 | 131012030120332213 |
5 | 1002441030033411 |
6 | 22204053324531 |
7 | 2154134136634 |
oct | 350614307647 |
9 | 88570117011 |
10 | 31242424231 |
11 | 12282596817 |
12 | 607b036747 |
13 | 2c3b8c1675 |
14 | 172545d18b |
15 | c2cc448c1 |
hex | 746318fa7 |
31242424231 has 2 divisors, whose sum is σ = 31242424232. Its totient is φ = 31242424230.
The previous prime is 31242424207. The next prime is 31242424243. The reversal of 31242424231 is 13242424213.
It is a strong prime.
It is an emirp because it is prime and its reverse (13242424213) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31242424231 - 215 = 31242391463 is a prime.
It is a super-2 number, since 2×312424242312 (a number of 22 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 31242424231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31242424331) 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 as a sum of consecutive naturals, namely, 15621212115 + 15621212116.
It is an arithmetic number, because the mean of its divisors is an integer number (15621212116).
Almost surely, 231242424231 is an apocalyptic number.
31242424231 is a deficient number, since it is larger than the sum of its proper divisors (1).
31242424231 is an equidigital number, since it uses as much as digits as its factorization.
31242424231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9216, while the sum is 28.
Adding to 31242424231 its reverse (13242424213), we get a palindrome (44484848444).
The spelling of 31242424231 in words is "thirty-one billion, two hundred forty-two million, four hundred twenty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •