Base | Representation |
---|---|
bin | 1001000011100000100… |
… | …01100111010100110011 |
3 | 1002202001120122011102112 |
4 | 10201300101213110303 |
5 | 20044134023423102 |
6 | 354532133235535 |
7 | 31322606336552 |
oct | 4416021472463 |
9 | 1082046564375 |
10 | 311121311027 |
11 | 10aa4496193a |
12 | 50369a92bab |
13 | 23452c1bb17 |
14 | 110b618dd99 |
15 | 815dc12252 |
hex | 4870467533 |
311121311027 has 2 divisors, whose sum is σ = 311121311028. Its totient is φ = 311121311026.
The previous prime is 311121311009. The next prime is 311121311113. The reversal of 311121311027 is 720113121113.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 311121311027 - 28 = 311121310771 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 311121310993 and 311121311011.
It is not a weakly prime, because it can be changed into another prime (311121311227) 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 as a sum of consecutive naturals, namely, 155560655513 + 155560655514.
It is an arithmetic number, because the mean of its divisors is an integer number (155560655514).
Almost surely, 2311121311027 is an apocalyptic number.
311121311027 is a deficient number, since it is larger than the sum of its proper divisors (1).
311121311027 is an equidigital number, since it uses as much as digits as its factorization.
311121311027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 23.
The spelling of 311121311027 in words is "three hundred eleven billion, one hundred twenty-one million, three hundred eleven thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •