Base | Representation |
---|---|
bin | 10000000111100… |
… | …10101000101111 |
3 | 100102102110101211 |
4 | 20003302220233 |
5 | 234103232232 |
6 | 21230015251 |
7 | 3231164551 |
oct | 1003625057 |
9 | 312373354 |
10 | 135211567 |
11 | 6a3614a7 |
12 | 39347527 |
13 | 2202195a |
14 | 13d594d1 |
15 | bd0ca47 |
hex | 80f2a2f |
135211567 has 2 divisors, whose sum is σ = 135211568. Its totient is φ = 135211566.
The previous prime is 135211537. The next prime is 135211577. The reversal of 135211567 is 765112531.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135211567 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135211507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67605783 + 67605784.
It is an arithmetic number, because the mean of its divisors is an integer number (67605784).
Almost surely, 2135211567 is an apocalyptic number.
135211567 is a deficient number, since it is larger than the sum of its proper divisors (1).
135211567 is an equidigital number, since it uses as much as digits as its factorization.
135211567 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6300, while the sum is 31.
The square root of 135211567 is about 11628.0508684818. The cubic root of 135211567 is about 513.2606252319.
The spelling of 135211567 in words is "one hundred thirty-five million, two hundred eleven thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •