Base | Representation |
---|---|
bin | 1011111101101111110111… |
… | …1101000110001100000011 |
3 | 1201120122111222001202011201 |
4 | 2333123331331012030003 |
5 | 3211014330312342011 |
6 | 43551310332322031 |
7 | 2525310220221514 |
oct | 277337575061403 |
9 | 51518458052151 |
10 | 13155450512131 |
11 | 4212216941324 |
12 | 1585745913317 |
13 | 745727512285 |
14 | 336a2762aa0b |
15 | 17c30ba0ccc1 |
hex | bf6fdf46303 |
13155450512131 has 2 divisors, whose sum is σ = 13155450512132. Its totient is φ = 13155450512130.
The previous prime is 13155450512027. The next prime is 13155450512167. The reversal of 13155450512131 is 13121505455131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13155450512131 - 237 = 13018011558659 is a prime.
It is a super-2 number, since 2×131554505121312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13155450515131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6577725256065 + 6577725256066.
It is an arithmetic number, because the mean of its divisors is an integer number (6577725256066).
Almost surely, 213155450512131 is an apocalyptic number.
13155450512131 is a deficient number, since it is larger than the sum of its proper divisors (1).
13155450512131 is an equidigital number, since it uses as much as digits as its factorization.
13155450512131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45000, while the sum is 37.
Adding to 13155450512131 its reverse (13121505455131), we get a palindrome (26276955967262).
The spelling of 13155450512131 in words is "thirteen trillion, one hundred fifty-five billion, four hundred fifty million, five hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •