Base | Representation |
---|---|
bin | 11110110011000110110100… |
… | …111111011001001100111011 |
3 | 122202121012221202002121201001 |
4 | 132303012310333121030323 |
5 | 120223232101023144011 |
6 | 1200030235301305431 |
7 | 40350121011041314 |
oct | 3663066477311473 |
9 | 582535852077631 |
10 | 135453420131131 |
11 | 3a183522445293 |
12 | 13237944405277 |
13 | 5a7728347b31b |
14 | 2563da276560b |
15 | 109d6c343a7c1 |
hex | 7b31b4fd933b |
135453420131131 has 2 divisors, whose sum is σ = 135453420131132. Its totient is φ = 135453420131130.
The previous prime is 135453420130999. The next prime is 135453420131167. The reversal of 135453420131131 is 131131024354531.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135453420131131 is a prime.
It is a super-2 number, since 2×1354534201311312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (135453420138131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67726710065565 + 67726710065566.
It is an arithmetic number, because the mean of its divisors is an integer number (67726710065566).
Almost surely, 2135453420131131 is an apocalyptic number.
135453420131131 is a deficient number, since it is larger than the sum of its proper divisors (1).
135453420131131 is an equidigital number, since it uses as much as digits as its factorization.
135453420131131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64800, while the sum is 37.
Adding to 135453420131131 its reverse (131131024354531), we get a palindrome (266584444485662).
The spelling of 135453420131131 in words is "one hundred thirty-five trillion, four hundred fifty-three billion, four hundred twenty million, one hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •