Base | Representation |
---|---|
bin | 1001000011101100010… |
… | …10001010010011011001 |
3 | 1002202022110101010021202 |
4 | 10201312022022103121 |
5 | 20044334311123231 |
6 | 354550021043545 |
7 | 31325215345241 |
oct | 4416612122331 |
9 | 1082273333252 |
10 | 311220020441 |
11 | 10aa95651770 |
12 | 50396b565b5 |
13 | 2346a500065 |
14 | 110c5326b21 |
15 | 816770e5cb |
hex | 487628a4d9 |
311220020441 has 8 divisors (see below), whose sum is σ = 342874263168. Its totient is φ = 280126030000.
The previous prime is 311220020431. The next prime is 311220020473. The reversal of 311220020441 is 144020022113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 311220020441 - 226 = 311152911577 is a prime.
It is a super-2 number, since 2×3112200204412 (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 (311220020431) 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 in 7 ways as a sum of consecutive naturals, for example, 140061905 + ... + 140064126.
It is an arithmetic number, because the mean of its divisors is an integer number (42859282896).
Almost surely, 2311220020441 is an apocalyptic number.
It is an amenable number.
311220020441 is a deficient number, since it is larger than the sum of its proper divisors (31654242727).
311220020441 is a wasteful number, since it uses less digits than its factorization.
311220020441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280126143.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 311220020441 its reverse (144020022113), we get a palindrome (455240042554).
The spelling of 311220020441 in words is "three hundred eleven billion, two hundred twenty million, twenty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •