Base | Representation |
---|---|
bin | 11110101110101111001001… |
… | …010000000100011100010011 |
3 | 122201112111210202222222121201 |
4 | 132232233021100010130103 |
5 | 120203322033224224042 |
6 | 1155240252131132031 |
7 | 40316330054642323 |
oct | 3656571120043423 |
9 | 581474722888551 |
10 | 135153112336147 |
11 | 3a078127530074 |
12 | 131a96b3a44017 |
13 | 5a54b64952909 |
14 | 25536347c1283 |
15 | 1095998c2d1b7 |
hex | 7aebc9404713 |
135153112336147 has 2 divisors, whose sum is σ = 135153112336148. Its totient is φ = 135153112336146.
The previous prime is 135153112336129. The next prime is 135153112336163. The reversal of 135153112336147 is 741633211351531.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 135153112336147 - 219 = 135153111811859 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 135153112336097 and 135153112336106.
It is not a weakly prime, because it can be changed into another prime (135153112336127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67576556168073 + 67576556168074.
It is an arithmetic number, because the mean of its divisors is an integer number (67576556168074).
Almost surely, 2135153112336147 is an apocalyptic number.
135153112336147 is a deficient number, since it is larger than the sum of its proper divisors (1).
135153112336147 is an equidigital number, since it uses as much as digits as its factorization.
135153112336147 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 680400, while the sum is 46.
Adding to 135153112336147 its reverse (741633211351531), we get a palindrome (876786323687678).
The spelling of 135153112336147 in words is "one hundred thirty-five trillion, one hundred fifty-three billion, one hundred twelve million, three hundred thirty-six thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •