Base | Representation |
---|---|
bin | 1001000011011111010… |
… | …00000100111001110011 |
3 | 1002202000211010221200002 |
4 | 10201233220010321303 |
5 | 20044123232002011 |
6 | 354531104020215 |
7 | 31322414645525 |
oct | 4415750047163 |
9 | 1082024127602 |
10 | 311110422131 |
11 | 10aa397a4953 |
12 | 5036630166b |
13 | 234508a87a2 |
14 | 110b4957a15 |
15 | 815ccb0c3b |
hex | 486fa04e73 |
311110422131 has 4 divisors (see below), whose sum is σ = 311119139232. Its totient is φ = 311101705032.
The previous prime is 311110422097. The next prime is 311110422149. The reversal of 311110422131 is 131224011113.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-311110422131 is a prime.
It is a super-2 number, since 2×3111104221312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (311110422331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4304795 + ... + 4376468.
It is an arithmetic number, because the mean of its divisors is an integer number (77779784808).
Almost surely, 2311110422131 is an apocalyptic number.
311110422131 is a deficient number, since it is larger than the sum of its proper divisors (8717101).
311110422131 is an equidigital number, since it uses as much as digits as its factorization.
311110422131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8717100.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 311110422131 its reverse (131224011113), we get a palindrome (442334433244).
The spelling of 311110422131 in words is "three hundred eleven billion, one hundred ten million, four hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •