Base | Representation |
---|---|
bin | 10000001010100… |
… | …00101101101111 |
3 | 100110011000222211 |
4 | 20011100231233 |
5 | 234203100121 |
6 | 21242151251 |
7 | 3234361162 |
oct | 1005205557 |
9 | 313130884 |
10 | 135596911 |
11 | 6a5a4a6a |
12 | 394b2527 |
13 | 22128178 |
14 | 14019ad9 |
15 | bd86ce1 |
hex | 8150b6f |
135596911 has 2 divisors, whose sum is σ = 135596912. Its totient is φ = 135596910.
The previous prime is 135596869. The next prime is 135596917. The reversal of 135596911 is 119695531.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135596911 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135596917) 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, 67798455 + 67798456.
It is an arithmetic number, because the mean of its divisors is an integer number (67798456).
Almost surely, 2135596911 is an apocalyptic number.
135596911 is a deficient number, since it is larger than the sum of its proper divisors (1).
135596911 is an equidigital number, since it uses as much as digits as its factorization.
135596911 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 36450, while the sum is 40.
The square root of 135596911 is about 11644.6086666749. The cubic root of 135596911 is about 513.7477490168.
The spelling of 135596911 in words is "one hundred thirty-five million, five hundred ninety-six thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •