Base | Representation |
---|---|
bin | 1001000011100001101… |
… | …11000010001010001111 |
3 | 1002202002021002112011212 |
4 | 10201300313002022033 |
5 | 20044144031322041 |
6 | 354533123405035 |
7 | 31323055613126 |
oct | 4416067021217 |
9 | 1082067075155 |
10 | 311131120271 |
11 | 10aa4a451754 |
12 | 5037122377b |
13 | 23454c748ca |
14 | 110b75c4abd |
15 | 815e9ed8eb |
hex | 4870dc228f |
311131120271 has 2 divisors, whose sum is σ = 311131120272. Its totient is φ = 311131120270.
The previous prime is 311131120249. The next prime is 311131120273. The reversal of 311131120271 is 172021131113.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-311131120271 is a prime.
It is a super-2 number, since 2×3111311202712 (a number of 24 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 311131120273, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (311131120273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155565560135 + 155565560136.
It is an arithmetic number, because the mean of its divisors is an integer number (155565560136).
Almost surely, 2311131120271 is an apocalyptic number.
311131120271 is a deficient number, since it is larger than the sum of its proper divisors (1).
311131120271 is an equidigital number, since it uses as much as digits as its factorization.
311131120271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 23.
Adding to 311131120271 its reverse (172021131113), we get a palindrome (483152251384).
The spelling of 311131120271 in words is "three hundred eleven billion, one hundred thirty-one million, one hundred twenty thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.307 sec. • engine limits •