Base | Representation |
---|---|
bin | 11110101110000011010… |
… | …001010111111111001011 |
3 | 21110210221101211220220011 |
4 | 132232003101113333023 |
5 | 234041343003443311 |
6 | 4253443331212351 |
7 | 305342216042014 |
oct | 36560321277713 |
9 | 7423841756804 |
10 | 2111031312331 |
11 | 744313161137 |
12 | 2a11701470b7 |
13 | 1240b9612856 |
14 | 74262a1200b |
15 | 39da58de321 |
hex | 1eb83457fcb |
2111031312331 has 2 divisors, whose sum is σ = 2111031312332. Its totient is φ = 2111031312330.
The previous prime is 2111031312329. The next prime is 2111031312353. The reversal of 2111031312331 is 1332131301112.
It is an a-pointer prime, because the next prime (2111031312353) can be obtained adding 2111031312331 to its sum of digits (22).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2111031312331 - 21 = 2111031312329 is a prime.
It is a super-2 number, since 2×21110313123312 (a number of 25 digits) contains 22 as substring.
Together with 2111031312329, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2111031312301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055515656165 + 1055515656166.
It is an arithmetic number, because the mean of its divisors is an integer number (1055515656166).
Almost surely, 22111031312331 is an apocalyptic number.
2111031312331 is a deficient number, since it is larger than the sum of its proper divisors (1).
2111031312331 is an equidigital number, since it uses as much as digits as its factorization.
2111031312331 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 2111031312331 its reverse (1332131301112), we get a palindrome (3443162613443).
The spelling of 2111031312331 in words is "two trillion, one hundred eleven billion, thirty-one million, three hundred twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •