Base | Representation |
---|---|
bin | 11101100011100111000… |
… | …011111001001100110011 |
3 | 21012011121221002111211201 |
4 | 131203213003321030303 |
5 | 231234143341340311 |
6 | 4153024105552031 |
7 | 266512402450132 |
oct | 35434703711463 |
9 | 7164557074751 |
10 | 2031101121331 |
11 | 7134266a5647 |
12 | 2897837a5617 |
13 | 1196bbab0649 |
14 | 7043d249919 |
15 | 37c7860e9c1 |
hex | 1d8e70f9333 |
2031101121331 has 2 divisors, whose sum is σ = 2031101121332. Its totient is φ = 2031101121330.
The previous prime is 2031101121317. The next prime is 2031101121347. The reversal of 2031101121331 is 1331211011302.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2031101121331 - 211 = 2031101119283 is a prime.
It is a super-2 number, since 2×20311011213312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2031101121299 and 2031101121308.
It is not a weakly prime, because it can be changed into another prime (2031101121311) 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, 1015550560665 + 1015550560666.
It is an arithmetic number, because the mean of its divisors is an integer number (1015550560666).
Almost surely, 22031101121331 is an apocalyptic number.
2031101121331 is a deficient number, since it is larger than the sum of its proper divisors (1).
2031101121331 is an equidigital number, since it uses as much as digits as its factorization.
2031101121331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 2031101121331 its reverse (1331211011302), we get a palindrome (3362312132633).
The spelling of 2031101121331 in words is "two trillion, thirty-one billion, one hundred one million, one hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •