Base | Representation |
---|---|
bin | 101100000111001000010… |
… | …110001011101111010011 |
3 | 101201210100102120202111012 |
4 | 230013020112023233103 |
5 | 344131112134432011 |
6 | 10240322134041135 |
7 | 432001524040424 |
oct | 54071026135723 |
9 | 11653312522435 |
10 | 3031313202131 |
11 | a69633304a25 |
12 | 40b5a47a91ab |
13 | 18cb0bca3186 |
14 | a6a058db64b |
15 | 53cb87b9a8b |
hex | 2c1c858bbd3 |
3031313202131 has 2 divisors, whose sum is σ = 3031313202132. Its totient is φ = 3031313202130.
The previous prime is 3031313202061. The next prime is 3031313202139. The reversal of 3031313202131 is 1312023131303.
3031313202131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3031313202131 - 222 = 3031309007827 is a prime.
It is a super-2 number, since 2×30313132021312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3031313202097 and 3031313202106.
It is not a weakly prime, because it can be changed into another prime (3031313202139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1515656601065 + 1515656601066.
It is an arithmetic number, because the mean of its divisors is an integer number (1515656601066).
Almost surely, 23031313202131 is an apocalyptic number.
3031313202131 is a deficient number, since it is larger than the sum of its proper divisors (1).
3031313202131 is an equidigital number, since it uses as much as digits as its factorization.
3031313202131 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 3031313202131 its reverse (1312023131303), we get a palindrome (4343336333434).
The spelling of 3031313202131 in words is "three trillion, thirty-one billion, three hundred thirteen million, two hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •