Base | Representation |
---|---|
bin | 10000001010011… |
… | …00100110100101 |
3 | 100110010011220001 |
4 | 20011030212211 |
5 | 234202030234 |
6 | 21241541301 |
7 | 3234261112 |
oct | 1005144645 |
9 | 313104801 |
10 | 135580069 |
11 | 6a593349 |
12 | 394a4831 |
13 | 221205c1 |
14 | 14013909 |
15 | bd81d14 |
hex | 814c9a5 |
135580069 has 2 divisors, whose sum is σ = 135580070. Its totient is φ = 135580068.
The previous prime is 135580043. The next prime is 135580073. The reversal of 135580069 is 960085531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105472900 + 30107169 = 10270^2 + 5487^2 .
It is a cyclic number.
It is not a de Polignac number, because 135580069 - 215 = 135547301 is a prime.
It is a super-2 number, since 2×1355800692 = 36763910220089522, which contains 22 as substring.
It is equal to p7676407 and since 135580069 and 7676407 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135580079) 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, 67790034 + 67790035.
It is an arithmetic number, because the mean of its divisors is an integer number (67790035).
Almost surely, 2135580069 is an apocalyptic number.
It is an amenable number.
135580069 is a deficient number, since it is larger than the sum of its proper divisors (1).
135580069 is an equidigital number, since it uses as much as digits as its factorization.
135580069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 37.
The square root of 135580069 is about 11643.8854769360. The cubic root of 135580069 is about 513.7264778886.
The spelling of 135580069 in words is "one hundred thirty-five million, five hundred eighty thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •