Base | Representation |
---|---|
bin | 10000001011000… |
… | …01010011101001 |
3 | 100110021111012221 |
4 | 20011201103221 |
5 | 234212233443 |
6 | 21243434041 |
7 | 3235063261 |
oct | 1005412351 |
9 | 313244187 |
10 | 135664873 |
11 | 6a641033 |
12 | 39525921 |
13 | 22150096 |
14 | 140367a1 |
15 | bd9beed |
hex | 81614e9 |
135664873 has 2 divisors, whose sum is σ = 135664874. Its totient is φ = 135664872.
The previous prime is 135664849. The next prime is 135664877. The reversal of 135664873 is 378466531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110944089 + 24720784 = 10533^2 + 4972^2 .
It is a cyclic number.
It is not a de Polignac number, because 135664873 - 213 = 135656681 is a prime.
It is a super-2 number, since 2×1356648732 = 36809915532212258, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (135664877) 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, 67832436 + 67832437.
It is an arithmetic number, because the mean of its divisors is an integer number (67832437).
Almost surely, 2135664873 is an apocalyptic number.
It is an amenable number.
135664873 is a deficient number, since it is larger than the sum of its proper divisors (1).
135664873 is an equidigital number, since it uses as much as digits as its factorization.
135664873 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 362880, while the sum is 43.
The square root of 135664873 is about 11647.5264756085. The cubic root of 135664873 is about 513.8335658510.
The spelling of 135664873 in words is "one hundred thirty-five million, six hundred sixty-four thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •