Base | Representation |
---|---|
bin | 1001011000001111001111… |
… | …0001011011111000001011 |
3 | 1100111211002210121020001112 |
4 | 2112003303301123320023 |
5 | 2322422444400130011 |
6 | 33533134514440535 |
7 | 2113006153044614 |
oct | 226036361337013 |
9 | 40454083536045 |
10 | 10312011333131 |
11 | 3316332622712 |
12 | 11a665389314b |
13 | 59a559589231 |
14 | 27916559cc0b |
15 | 12d38bd6058b |
hex | 960f3c5be0b |
10312011333131 has 2 divisors, whose sum is σ = 10312011333132. Its totient is φ = 10312011333130.
The previous prime is 10312011333059. The next prime is 10312011333161. The reversal of 10312011333131 is 13133311021301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10312011333131 - 210 = 10312011332107 is a prime.
It is a super-2 number, since 2×103120113331312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10312011333097 and 10312011333106.
It is not a weakly prime, because it can be changed into another prime (10312011333161) 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, 5156005666565 + 5156005666566.
It is an arithmetic number, because the mean of its divisors is an integer number (5156005666566).
Almost surely, 210312011333131 is an apocalyptic number.
10312011333131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10312011333131 is an equidigital number, since it uses as much as digits as its factorization.
10312011333131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 10312011333131 its reverse (13133311021301), we get a palindrome (23445322354432).
The spelling of 10312011333131 in words is "ten trillion, three hundred twelve billion, eleven million, three hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •