Base | Representation |
---|---|
bin | 11101000100011000… |
… | …110101010010001111 |
3 | 2222120020010120011022 |
4 | 131010120311102033 |
5 | 1002410301201341 |
6 | 22201052144355 |
7 | 2153315511563 |
oct | 350430652217 |
9 | 88506116138 |
10 | 31212131471 |
11 | 12267486384 |
12 | 6070a680bb |
13 | 2c35546361 |
14 | 17214156a3 |
15 | c2a25de4b |
hex | 74463548f |
31212131471 has 2 divisors, whose sum is σ = 31212131472. Its totient is φ = 31212131470.
The previous prime is 31212131437. The next prime is 31212131501. The reversal of 31212131471 is 17413121213.
It is a strong prime.
It is an emirp because it is prime and its reverse (17413121213) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31212131471 is a prime.
It is a super-3 number, since 3×312121314713 (a number of 32 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 31212131471.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31212139471) 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, 15606065735 + 15606065736.
It is an arithmetic number, because the mean of its divisors is an integer number (15606065736).
Almost surely, 231212131471 is an apocalyptic number.
31212131471 is a deficient number, since it is larger than the sum of its proper divisors (1).
31212131471 is an equidigital number, since it uses as much as digits as its factorization.
31212131471 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1008, while the sum is 26.
Adding to 31212131471 its reverse (17413121213), we get a palindrome (48625252684).
The spelling of 31212131471 in words is "thirty-one billion, two hundred twelve million, one hundred thirty-one thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •