Base | Representation |
---|---|
bin | 1001000011100000100… |
… | …00111101110110010111 |
3 | 1002202001120022112101112 |
4 | 10201300100331312113 |
5 | 20044134003004033 |
6 | 354532125445235 |
7 | 31322605031351 |
oct | 4416020756627 |
9 | 1082046275345 |
10 | 311121141143 |
11 | 10aa4485623a |
12 | 50369a1081b |
13 | 23452b8c6b7 |
14 | 110b61480d1 |
15 | 815dbcbc48 |
hex | 487043dd97 |
311121141143 has 4 divisors (see below), whose sum is σ = 311968883040. Its totient is φ = 310273399248.
The previous prime is 311121141103. The next prime is 311121141161. The reversal of 311121141143 is 341141121113.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 311121141143 - 220 = 311120092567 is a prime.
It is a super-2 number, since 2×3111211411432 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (311121141103) 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, 423870398 + ... + 423871131.
It is an arithmetic number, because the mean of its divisors is an integer number (77992220760).
Almost surely, 2311121141143 is an apocalyptic number.
311121141143 is a deficient number, since it is larger than the sum of its proper divisors (847741897).
311121141143 is an equidigital number, since it uses as much as digits as its factorization.
311121141143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 847741896.
The product of its digits is 288, while the sum is 23.
Adding to 311121141143 its reverse (341141121113), we get a palindrome (652262262256).
The spelling of 311121141143 in words is "three hundred eleven billion, one hundred twenty-one million, one hundred forty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •