Base | Representation |
---|---|
bin | 100011011001000000111010… |
… | …1100111111010011000110001 |
3 | 1111211020002211002012120221002 |
4 | 1012302001311213322120301 |
5 | 311300324330432323441 |
6 | 3022025444241411345 |
7 | 122366525004215111 |
oct | 10662016547723061 |
9 | 1454202732176832 |
10 | 311301203011121 |
11 | 9021010a5487a4 |
12 | 2aab8313039b55 |
13 | 1049176796466b |
14 | 56c30b6bc5041 |
15 | 25ec9d3109b9b |
hex | 11b20759fa631 |
311301203011121 has 16 divisors (see below), whose sum is σ = 327991658741760. Its totient is φ = 294873748701840.
The previous prime is 311301203011087. The next prime is 311301203011133. The reversal of 311301203011121 is 121110302103113.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-311301203011121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 311301203011093 and 311301203011102.
It is not an unprimeable number, because it can be changed into a prime (311301203010121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 659480816 + ... + 659952686.
It is an arithmetic number, because the mean of its divisors is an integer number (20499478671360).
Almost surely, 2311301203011121 is an apocalyptic number.
It is an amenable number.
311301203011121 is a deficient number, since it is larger than the sum of its proper divisors (16690455730639).
311301203011121 is a wasteful number, since it uses less digits than its factorization.
311301203011121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 750476.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 311301203011121 its reverse (121110302103113), we get a palindrome (432411505114234).
The spelling of 311301203011121 in words is "three hundred eleven trillion, three hundred one billion, two hundred three million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •