Base | Representation |
---|---|
bin | 100001101000010011000… |
… | …011001111011101110011 |
3 | 22011221010101211120012201 |
4 | 201220103003033131303 |
5 | 300330423034202011 |
6 | 4525355252004031 |
7 | 325652014034251 |
oct | 41502303173563 |
9 | 8157111746181 |
10 | 2311012022131 |
11 | 81110504731a |
12 | 313a81300617 |
13 | 139c099396b7 |
14 | 7dbd43115d1 |
15 | 401ac302cc1 |
hex | 21a130cf773 |
2311012022131 has 2 divisors, whose sum is σ = 2311012022132. Its totient is φ = 2311012022130.
The previous prime is 2311012022093. The next prime is 2311012022147. The reversal of 2311012022131 is 1312202101132.
2311012022131 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 2311012022131 - 27 = 2311012022003 is a prime.
It is a super-2 number, since 2×23110120221312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2311012022099 and 2311012022108.
It is not a weakly prime, because it can be changed into another prime (2311012022831) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1155506011065 + 1155506011066.
It is an arithmetic number, because the mean of its divisors is an integer number (1155506011066).
Almost surely, 22311012022131 is an apocalyptic number.
2311012022131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2311012022131 is an equidigital number, since it uses as much as digits as its factorization.
2311012022131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 2311012022131 its reverse (1312202101132), we get a palindrome (3623214123263).
The spelling of 2311012022131 in words is "two trillion, three hundred eleven billion, twelve million, twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •