Base | Representation |
---|---|
bin | 1110001111010101011000… |
… | …10011001101000000100011 |
3 | 11002212111211220111200201212 |
4 | 13013222230103031000203 |
5 | 13101013414242144021 |
6 | 150333030410020335 |
7 | 6411206225654126 |
oct | 707525423150043 |
9 | 132774756450655 |
10 | 31313202303011 |
11 | 9a82944403972 |
12 | 36188601176ab |
13 | 1461a8c7ba9b5 |
14 | 7a37d20c23bd |
15 | 3947dccb285b |
hex | 1c7aac4cd023 |
31313202303011 has 2 divisors, whose sum is σ = 31313202303012. Its totient is φ = 31313202303010.
The previous prime is 31313202302971. The next prime is 31313202303013. The reversal of 31313202303011 is 11030320231313.
It is a strong prime.
It is an emirp because it is prime and its reverse (11030320231313) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31313202303011 - 214 = 31313202286627 is a prime.
It is a super-2 number, since 2×313132023030112 (a number of 28 digits) contains 22 as substring.
Together with 31313202303013, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (31313202303013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15656601151505 + 15656601151506.
It is an arithmetic number, because the mean of its divisors is an integer number (15656601151506).
Almost surely, 231313202303011 is an apocalyptic number.
31313202303011 is a deficient number, since it is larger than the sum of its proper divisors (1).
31313202303011 is an equidigital number, since it uses as much as digits as its factorization.
31313202303011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 31313202303011 its reverse (11030320231313), we get a palindrome (42343522534324).
The spelling of 31313202303011 in words is "thirty-one trillion, three hundred thirteen billion, two hundred two million, three hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •