Base | Representation |
---|---|
bin | 10000010001100… |
… | …10000101110101 |
3 | 100111212221022021 |
4 | 20020302011311 |
5 | 234422120203 |
6 | 21314033141 |
7 | 3245254435 |
oct | 1010620565 |
9 | 314787267 |
10 | 136520053 |
11 | 7007559a |
12 | 398787b1 |
13 | 2238c3c7 |
14 | 141ba2c5 |
15 | beba5bd |
hex | 8232175 |
136520053 has 2 divisors, whose sum is σ = 136520054. Its totient is φ = 136520052.
The previous prime is 136520029. The next prime is 136520099. The reversal of 136520053 is 350025631.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 90592324 + 45927729 = 9518^2 + 6777^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-136520053 is a prime.
It is a super-2 number, since 2×1365200532 = 37275449742245618, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136520003) 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, 68260026 + 68260027.
It is an arithmetic number, because the mean of its divisors is an integer number (68260027).
Almost surely, 2136520053 is an apocalyptic number.
It is an amenable number.
136520053 is a deficient number, since it is larger than the sum of its proper divisors (1).
136520053 is an equidigital number, since it uses as much as digits as its factorization.
136520053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 25.
The square root of 136520053 is about 11684.1796032071. The cubic root of 136520053 is about 514.9109759087.
Adding to 136520053 its reverse (350025631), we get a palindrome (486545684).
The spelling of 136520053 in words is "one hundred thirty-six million, five hundred twenty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •