Base | Representation |
---|---|
bin | 100011010111100011101100… |
… | …1011000000000111000101011 |
3 | 1111210111222002111120112021002 |
4 | 1012233013121120000320223 |
5 | 311234034333323231443 |
6 | 3021353455445105215 |
7 | 122346210056112416 |
oct | 10657073130007053 |
9 | 1453458074515232 |
10 | 311101013102123 |
11 | 90143220567112 |
12 | 2aa855639b820b |
13 | 104789131b22ca |
14 | 56b75257cab7d |
15 | 25e76b81712b8 |
hex | 11af1d9600e2b |
311101013102123 has 2 divisors, whose sum is σ = 311101013102124. Its totient is φ = 311101013102122.
The previous prime is 311101013102057. The next prime is 311101013102147. The reversal of 311101013102123 is 321201310101113.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 311101013102123 - 212 = 311101013098027 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 311101013102095 and 311101013102104.
It is not a weakly prime, because it can be changed into another prime (311101013102153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155550506551061 + 155550506551062.
It is an arithmetic number, because the mean of its divisors is an integer number (155550506551062).
Almost surely, 2311101013102123 is an apocalyptic number.
311101013102123 is a deficient number, since it is larger than the sum of its proper divisors (1).
311101013102123 is an equidigital number, since it uses as much as digits as its factorization.
311101013102123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 311101013102123 its reverse (321201310101113), we get a palindrome (632302323203236).
The spelling of 311101013102123 in words is "three hundred eleven trillion, one hundred one billion, thirteen million, one hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •