Base | Representation |
---|---|
bin | 1001000011111001011… |
… | …11001110101100000111 |
3 | 1002202121011002000222202 |
4 | 10201330233032230013 |
5 | 20100101040313111 |
6 | 355005002545115 |
7 | 31331025513446 |
oct | 4417457165407 |
9 | 1082534060882 |
10 | 311330401031 |
11 | 1100419932a1 |
12 | 50407b0819b |
13 | 23487339710 |
14 | 110d5c5ad5d |
15 | 8172264b3b |
hex | 487cbceb07 |
311330401031 has 8 divisors (see below), whose sum is σ = 344340485664. Its totient is φ = 279614829600.
The previous prime is 311330401027. The next prime is 311330401037. The reversal of 311330401031 is 130104033113.
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 311330401031 - 22 = 311330401027 is a prime.
It is a super-2 number, since 2×3113304010312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 311330400994 and 311330401012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (311330401037) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 323627795 + ... + 323628756.
It is an arithmetic number, because the mean of its divisors is an integer number (43042560708).
Almost surely, 2311330401031 is an apocalyptic number.
311330401031 is a deficient number, since it is larger than the sum of its proper divisors (33010084633).
311330401031 is a wasteful number, since it uses less digits than its factorization.
311330401031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 647256601.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 311330401031 its reverse (130104033113), we get a palindrome (441434434144).
The spelling of 311330401031 in words is "three hundred eleven billion, three hundred thirty million, four hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •