Base | Representation |
---|---|
bin | 1001000011100000110… |
… | …00001111111110100001 |
3 | 1002202001200220112101210 |
4 | 10201300120033332201 |
5 | 20044140000103101 |
6 | 354532234420333 |
7 | 31322630202612 |
oct | 4416030177641 |
9 | 1082050815353 |
10 | 311123050401 |
11 | 10aa4593a739 |
12 | 5036a5916a9 |
13 | 234533aa737 |
14 | 110b64c3c09 |
15 | 815de577d6 |
hex | 487060ffa1 |
311123050401 has 4 divisors (see below), whose sum is σ = 414830733872. Its totient is φ = 207415366932.
The previous prime is 311123050393. The next prime is 311123050409. The reversal of 311123050401 is 104050321113.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (311123050393) and next prime (311123050409).
It is not a de Polignac number, because 311123050401 - 23 = 311123050393 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (311123050409) 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, 51853841731 + ... + 51853841736.
It is an arithmetic number, because the mean of its divisors is an integer number (103707683468).
Almost surely, 2311123050401 is an apocalyptic number.
It is an amenable number.
311123050401 is a deficient number, since it is larger than the sum of its proper divisors (103707683471).
311123050401 is a wasteful number, since it uses less digits than its factorization.
311123050401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103707683470.
The product of its (nonzero) digits is 360, while the sum is 21.
Adding to 311123050401 its reverse (104050321113), we get a palindrome (415173371514).
The spelling of 311123050401 in words is "three hundred eleven billion, one hundred twenty-three million, fifty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •