Base | Representation |
---|---|
bin | 1001000011111010101… |
… | …00001110100110101101 |
3 | 1002202121211022210111022 |
4 | 10201331110032212231 |
5 | 20100111031200023 |
6 | 355005550503525 |
7 | 31331204120405 |
oct | 4417524164655 |
9 | 1082554283438 |
10 | 311340100013 |
11 | 110047408288 |
12 | 5040b204ba5 |
13 | 23489354267 |
14 | 110d7263805 |
15 | 817302d7c8 |
hex | 487d50e9ad |
311340100013 has 2 divisors, whose sum is σ = 311340100014. Its totient is φ = 311340100012.
The previous prime is 311340099953. The next prime is 311340100033. The reversal of 311340100013 is 310001043113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 183789691849 + 127550408164 = 428707^2 + 357142^2 .
It is a cyclic number.
It is not a de Polignac number, because 311340100013 - 216 = 311340034477 is a prime.
It is a super-2 number, since 2×3113401000132 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 311340099964 and 311340100000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (311340100033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155670050006 + 155670050007.
It is an arithmetic number, because the mean of its divisors is an integer number (155670050007).
Almost surely, 2311340100013 is an apocalyptic number.
It is an amenable number.
311340100013 is a deficient number, since it is larger than the sum of its proper divisors (1).
311340100013 is an equidigital number, since it uses as much as digits as its factorization.
311340100013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 311340100013 its reverse (310001043113), we get a palindrome (621341143126).
The spelling of 311340100013 in words is "three hundred eleven billion, three hundred forty million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •