Base | Representation |
---|---|
bin | 1011111011001011011110… |
… | …1111111111110011110001 |
3 | 1201102102121122100212112101 |
4 | 2332302313233333303301 |
5 | 3204303442142000144 |
6 | 43515131510500401 |
7 | 2522155543445011 |
oct | 276626757776361 |
9 | 51372548325471 |
10 | 13111323000049 |
11 | 41a553202737a |
12 | 157908b664701 |
13 | 7415142b4091 |
14 | 33483cbd5c41 |
15 | 17b0c79b46d4 |
hex | becb7bffcf1 |
13111323000049 has 2 divisors, whose sum is σ = 13111323000050. Its totient is φ = 13111323000048.
The previous prime is 13111322999993. The next prime is 13111323000067. The reversal of 13111323000049 is 94000032311131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9327111457024 + 3784211543025 = 3054032^2 + 1945305^2 .
It is a cyclic number.
It is not a de Polignac number, because 13111323000049 - 229 = 13110786129137 is a prime.
It is a super-2 number, since 2×131113230000492 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13111322999990 and 13111323000026.
It is not a weakly prime, because it can be changed into another prime (13111323030049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6555661500024 + 6555661500025.
It is an arithmetic number, because the mean of its divisors is an integer number (6555661500025).
Almost surely, 213111323000049 is an apocalyptic number.
It is an amenable number.
13111323000049 is a deficient number, since it is larger than the sum of its proper divisors (1).
13111323000049 is an equidigital number, since it uses as much as digits as its factorization.
13111323000049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 28.
The spelling of 13111323000049 in words is "thirteen trillion, one hundred eleven billion, three hundred twenty-three million, forty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •