Base | Representation |
---|---|
bin | 1110001100011001011101… |
… | …01101110110101010101001 |
3 | 11002111212102121221011202001 |
4 | 13012030232231312222221 |
5 | 13042340303121043421 |
6 | 150214423205411001 |
7 | 6401005111000141 |
oct | 706145655665251 |
9 | 132455377834661 |
10 | 31212311112361 |
11 | 9a44080a13075 |
12 | 36011a3a09a61 |
13 | 145540147a512 |
14 | 79c980959921 |
15 | 391d856db691 |
hex | 1c632eb76aa9 |
31212311112361 has 2 divisors, whose sum is σ = 31212311112362. Its totient is φ = 31212311112360.
The previous prime is 31212311112317. The next prime is 31212311112371. The reversal of 31212311112361 is 16321111321213.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28229626680336 + 2982684432025 = 5313156^2 + 1727045^2 .
It is an emirp because it is prime and its reverse (16321111321213) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31212311112361 is a prime.
It is not a weakly prime, because it can be changed into another prime (31212311112371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15606155556180 + 15606155556181.
It is an arithmetic number, because the mean of its divisors is an integer number (15606155556181).
Almost surely, 231212311112361 is an apocalyptic number.
It is an amenable number.
31212311112361 is a deficient number, since it is larger than the sum of its proper divisors (1).
31212311112361 is an equidigital number, since it uses as much as digits as its factorization.
31212311112361 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1296, while the sum is 28.
Adding to 31212311112361 its reverse (16321111321213), we get a palindrome (47533422433574).
The spelling of 31212311112361 in words is "thirty-one trillion, two hundred twelve billion, three hundred eleven million, one hundred twelve thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •