Base | Representation |
---|---|
bin | 100011010111000110100011… |
… | …0110110110010100000101101 |
3 | 1111210021222112122201122201201 |
4 | 1012232031012312302200231 |
5 | 311232023143344024223 |
6 | 3021305025141005501 |
7 | 122341533065166151 |
oct | 10656150666624055 |
9 | 1453258478648651 |
10 | 311038425376813 |
11 | 901197234087a2 |
12 | 2aa753b73b3891 |
13 | 10472a4a5bc214 |
14 | 56b44a93ad061 |
15 | 25e5c53664ead |
hex | 11ae346db282d |
311038425376813 has 2 divisors, whose sum is σ = 311038425376814. Its totient is φ = 311038425376812.
The previous prime is 311038425376733. The next prime is 311038425376823. The reversal of 311038425376813 is 318673524830113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 285342468078889 + 25695957297924 = 16892083^2 + 5069118^2 .
It is an emirp because it is prime and its reverse (318673524830113) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-311038425376813 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (311038425376823) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155519212688406 + 155519212688407.
It is an arithmetic number, because the mean of its divisors is an integer number (155519212688407).
Almost surely, 2311038425376813 is an apocalyptic number.
It is an amenable number.
311038425376813 is a deficient number, since it is larger than the sum of its proper divisors (1).
311038425376813 is an equidigital number, since it uses as much as digits as its factorization.
311038425376813 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8709120, while the sum is 55.
The spelling of 311038425376813 in words is "three hundred eleven trillion, thirty-eight billion, four hundred twenty-five million, three hundred seventy-six thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •