Base | Representation |
---|---|
bin | 10000001001010… |
… | …01101001100101 |
3 | 100102211220111112 |
4 | 20010221221211 |
5 | 234132440101 |
6 | 21234514405 |
7 | 3233123525 |
oct | 1004515145 |
9 | 312756445 |
10 | 135436901 |
11 | 6a4a5826 |
12 | 39435a05 |
13 | 220a03a2 |
14 | 13db7685 |
15 | bd546bb |
hex | 8129a65 |
135436901 has 2 divisors, whose sum is σ = 135436902. Its totient is φ = 135436900.
The previous prime is 135436867. The next prime is 135436933. The reversal of 135436901 is 109634531.
It is an a-pointer prime, because the next prime (135436933) can be obtained adding 135436901 to its sum of digits (32).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83740801 + 51696100 = 9151^2 + 7190^2 .
It is a cyclic number.
It is not a de Polignac number, because 135436901 - 26 = 135436837 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135436001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67718450 + 67718451.
It is an arithmetic number, because the mean of its divisors is an integer number (67718451).
Almost surely, 2135436901 is an apocalyptic number.
It is an amenable number.
135436901 is a deficient number, since it is larger than the sum of its proper divisors (1).
135436901 is an equidigital number, since it uses as much as digits as its factorization.
135436901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 32.
The square root of 135436901 is about 11637.7360770899. The cubic root of 135436901 is about 513.5455882327.
The spelling of 135436901 in words is "one hundred thirty-five million, four hundred thirty-six thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •