Base | Representation |
---|---|
bin | 100011010111101101111111… |
… | …1101101100001011010111111 |
3 | 1111210121002011221111210121212 |
4 | 1012233123333231201122333 |
5 | 311234420133031023403 |
6 | 3021411554314515035 |
7 | 122350622140100543 |
oct | 10657337755413277 |
9 | 1453532157453555 |
10 | 311123131111103 |
11 | 90151640604683 |
12 | 2aa898b7135a7b |
13 | 1047aa29611b9c |
14 | 56b86230c9a23 |
15 | 25e805ed104d8 |
hex | 11af6ffb616bf |
311123131111103 has 4 divisors (see below), whose sum is σ = 313876433156448. Its totient is φ = 308369829065760.
The previous prime is 311123131111087. The next prime is 311123131111129. The reversal of 311123131111103 is 301111131321113.
It is a happy number.
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 311123131111103 - 24 = 311123131111087 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (311123131111703) 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, 1376651022503 + ... + 1376651022728.
It is an arithmetic number, because the mean of its divisors is an integer number (78469108289112).
Almost surely, 2311123131111103 is an apocalyptic number.
311123131111103 is a deficient number, since it is larger than the sum of its proper divisors (2753302045345).
311123131111103 is a wasteful number, since it uses less digits than its factorization.
311123131111103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2753302045344.
The product of its (nonzero) digits is 162, while the sum is 23.
Adding to 311123131111103 its reverse (301111131321113), we get a palindrome (612234262432216).
The spelling of 311123131111103 in words is "three hundred eleven trillion, one hundred twenty-three billion, one hundred thirty-one million, one hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •