Base | Representation |
---|---|
bin | 1100000110001110001100… |
… | …1111110001101100000011 |
3 | 1202002120021202000122022012 |
4 | 3001203203033301230003 |
5 | 3220411003003442011 |
6 | 44142224234203135 |
7 | 2541652645466663 |
oct | 301434317615403 |
9 | 52076252018265 |
10 | 13301031312131 |
11 | 4268a32467072 |
12 | 15a99b45834ab |
13 | 756388368494 |
14 | 33dab81061a3 |
15 | 180ecc65ea8b |
hex | c18e33f1b03 |
13301031312131 has 2 divisors, whose sum is σ = 13301031312132. Its totient is φ = 13301031312130.
The previous prime is 13301031312109. The next prime is 13301031312143. The reversal of 13301031312131 is 13121313010331.
It is a strong prime.
It is an emirp because it is prime and its reverse (13121313010331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13301031312131 - 210 = 13301031311107 is a prime.
It is a super-2 number, since 2×133010313121312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13301031312097 and 13301031312106.
It is not a weakly prime, because it can be changed into another prime (13301031312631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6650515656065 + 6650515656066.
It is an arithmetic number, because the mean of its divisors is an integer number (6650515656066).
Almost surely, 213301031312131 is an apocalyptic number.
13301031312131 is a deficient number, since it is larger than the sum of its proper divisors (1).
13301031312131 is an equidigital number, since it uses as much as digits as its factorization.
13301031312131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 13301031312131 its reverse (13121313010331), we get a palindrome (26422344322462).
The spelling of 13301031312131 in words is "thirteen trillion, three hundred one billion, thirty-one million, three hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •