Base | Representation |
---|---|
bin | 1001000011011110010… |
… | …00011010000001010111 |
3 | 1002202000020112011022121 |
4 | 10201233020122001113 |
5 | 20044114120320043 |
6 | 354530210040411 |
7 | 31322254250242 |
oct | 4415710320127 |
9 | 1082006464277 |
10 | 311102120023 |
11 | 10aa35044402 |
12 | 50363579107 |
13 | 2344bc5c9b6 |
14 | 110b37d6259 |
15 | 815c1c0ded |
hex | 486f21a057 |
311102120023 has 2 divisors, whose sum is σ = 311102120024. Its totient is φ = 311102120022.
The previous prime is 311102120011. The next prime is 311102120027. The reversal of 311102120023 is 320021201113.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-311102120023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 311102119979 and 311102120006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (311102120027) 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, 155551060011 + 155551060012.
It is an arithmetic number, because the mean of its divisors is an integer number (155551060012).
Almost surely, 2311102120023 is an apocalyptic number.
311102120023 is a deficient number, since it is larger than the sum of its proper divisors (1).
311102120023 is an equidigital number, since it uses as much as digits as its factorization.
311102120023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 311102120023 its reverse (320021201113), we get a palindrome (631123321136).
The spelling of 311102120023 in words is "three hundred eleven billion, one hundred two million, one hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •