Base | Representation |
---|---|
bin | 1011111100111111010011… |
… | …0111000100001010011001 |
3 | 1201112101212100202020120101 |
4 | 2333033310313010022121 |
5 | 3210311130214043022 |
6 | 43541312522055401 |
7 | 2524336150411552 |
oct | 277176467041231 |
9 | 51471770666511 |
10 | 13142413034137 |
11 | 4207736599122 |
12 | 158310764a561 |
13 | 74442a44a95a |
14 | 33614bd07329 |
15 | 17bce7156627 |
hex | bf3f4dc4299 |
13142413034137 has 2 divisors, whose sum is σ = 13142413034138. Its totient is φ = 13142413034136.
The previous prime is 13142413034077. The next prime is 13142413034141. The reversal of 13142413034137 is 73143031424131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6708535127056 + 6433877907081 = 2590084^2 + 2536509^2 .
It is a cyclic number.
It is not a de Polignac number, because 13142413034137 - 215 = 13142413001369 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13142413034096 and 13142413034105.
It is not a weakly prime, because it can be changed into another prime (13142413034837) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6571206517068 + 6571206517069.
It is an arithmetic number, because the mean of its divisors is an integer number (6571206517069).
Almost surely, 213142413034137 is an apocalyptic number.
It is an amenable number.
13142413034137 is a deficient number, since it is larger than the sum of its proper divisors (1).
13142413034137 is an equidigital number, since it uses as much as digits as its factorization.
13142413034137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72576, while the sum is 37.
Adding to 13142413034137 its reverse (73143031424131), we get a palindrome (86285444458268).
The spelling of 13142413034137 in words is "thirteen trillion, one hundred forty-two billion, four hundred thirteen million, thirty-four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •