Base | Representation |
---|---|
bin | 1001000011010100100… |
… | …11000010011111001011 |
3 | 1002201210120220220112221 |
4 | 10201222103002133023 |
5 | 20043432340134011 |
6 | 354514151514511 |
7 | 31320251026312 |
oct | 4415223023713 |
9 | 1081716826487 |
10 | 311021021131 |
11 | 10a9a3292627 |
12 | 50340388a37 |
13 | 234382063a2 |
14 | 110a6b25279 |
15 | 8155001971 |
hex | 486a4c27cb |
311021021131 has 4 divisors (see below), whose sum is σ = 315663125992. Its totient is φ = 306378916272.
The previous prime is 311021021107. The next prime is 311021021137. The reversal of 311021021131 is 131120120113.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131120120113 = 2351 ⋅55772063.
It is a cyclic number.
It is not a de Polignac number, because 311021021131 - 25 = 311021021099 is a prime.
It is a super-2 number, since 2×3110210211312 (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 (311021021137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2321052330 + ... + 2321052463.
It is an arithmetic number, because the mean of its divisors is an integer number (78915781498).
Almost surely, 2311021021131 is an apocalyptic number.
311021021131 is a deficient number, since it is larger than the sum of its proper divisors (4642104861).
311021021131 is an equidigital number, since it uses as much as digits as its factorization.
311021021131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4642104860.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 311021021131 its reverse (131120120113), we get a palindrome (442141141244).
The spelling of 311021021131 in words is "three hundred eleven billion, twenty-one million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •