Base | Representation |
---|---|
bin | 1001011000001011100101… |
… | …0011100101110110011011 |
3 | 1100111201120102212020110211 |
4 | 2112002321103211312123 |
5 | 2322413442242244011 |
6 | 33532453314351551 |
7 | 2112642642365203 |
oct | 226027123456633 |
9 | 40451512766424 |
10 | 10311030431131 |
11 | 3315979963501 |
12 | 11a641b28b5b7 |
13 | 59a4312a7a51 |
14 | 2790b11c3403 |
15 | 12d330ba2b21 |
hex | 960b94e5d9b |
10311030431131 has 2 divisors, whose sum is σ = 10311030431132. Its totient is φ = 10311030431130.
The previous prime is 10311030431087. The next prime is 10311030431147. The reversal of 10311030431131 is 13113403011301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10311030431131 - 213 = 10311030422939 is a prime.
It is a super-2 number, since 2×103110304311312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10311030431171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5155515215565 + 5155515215566.
It is an arithmetic number, because the mean of its divisors is an integer number (5155515215566).
Almost surely, 210311030431131 is an apocalyptic number.
10311030431131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10311030431131 is an equidigital number, since it uses as much as digits as its factorization.
10311030431131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 10311030431131 its reverse (13113403011301), we get a palindrome (23424433442432).
The spelling of 10311030431131 in words is "ten trillion, three hundred eleven billion, thirty million, four hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •