Base | Representation |
---|---|
bin | 11111000001110000101111… |
… | …101111111101011100110011 |
3 | 122220011111102000100210021122 |
4 | 133001300233233331130303 |
5 | 120341232102004431011 |
6 | 1202121031133412455 |
7 | 40512642310662236 |
oct | 3701605757753463 |
9 | 586144360323248 |
10 | 136460502030131 |
11 | 3a531634972774 |
12 | 1337ab6203a12b |
13 | 5b1b2299c6636 |
14 | 259aa1b56741d |
15 | 10b99b67973db |
hex | 7c1c2fbfd733 |
136460502030131 has 2 divisors, whose sum is σ = 136460502030132. Its totient is φ = 136460502030130.
The previous prime is 136460502030109. The next prime is 136460502030197. The reversal of 136460502030131 is 131030205064631.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-136460502030131 is a prime.
It is a super-2 number, since 2×1364605020301312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 136460502030091 and 136460502030100.
It is not a weakly prime, because it can be changed into another prime (136460502230131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68230251015065 + 68230251015066.
It is an arithmetic number, because the mean of its divisors is an integer number (68230251015066).
Almost surely, 2136460502030131 is an apocalyptic number.
136460502030131 is a deficient number, since it is larger than the sum of its proper divisors (1).
136460502030131 is an equidigital number, since it uses as much as digits as its factorization.
136460502030131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 38880, while the sum is 35.
Adding to 136460502030131 its reverse (131030205064631), we get a palindrome (267490707094762).
The spelling of 136460502030131 in words is "one hundred thirty-six trillion, four hundred sixty billion, five hundred two million, thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •