Base | Representation |
---|---|
bin | 1011111011001010101001… |
… | …1101010100111011101111 |
3 | 1201102102001002202101202112 |
4 | 2332302222131110323233 |
5 | 3204303013100031111 |
6 | 43515053423114235 |
7 | 2522150165134013 |
oct | 276625235247357 |
9 | 51372032671675 |
10 | 13111100002031 |
11 | 41a5428166699 |
12 | 1579028a4297b |
13 | 7414aa036ba5 |
14 | 33481b348543 |
15 | 17b0b3115e8b |
hex | becaa754eef |
13111100002031 has 2 divisors, whose sum is σ = 13111100002032. Its totient is φ = 13111100002030.
The previous prime is 13111100002001. The next prime is 13111100002037. The reversal of 13111100002031 is 13020000111131.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13111100002031 - 230 = 13110026260207 is a prime.
It is a super-3 number, since 3×131111000020313 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 13111100001997 and 13111100002015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13111100002037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6555550001015 + 6555550001016.
It is an arithmetic number, because the mean of its divisors is an integer number (6555550001016).
Almost surely, 213111100002031 is an apocalyptic number.
13111100002031 is a deficient number, since it is larger than the sum of its proper divisors (1).
13111100002031 is an equidigital number, since it uses as much as digits as its factorization.
13111100002031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 13111100002031 its reverse (13020000111131), we get a palindrome (26131100113162).
The spelling of 13111100002031 in words is "thirteen trillion, one hundred eleven billion, one hundred million, two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •