Base | Representation |
---|---|
bin | 10000010010001… |
… | …11001001010101 |
3 | 100112001022121100 |
4 | 20021013021111 |
5 | 234432400133 |
6 | 21315540313 |
7 | 3246064035 |
oct | 1011071125 |
9 | 315038540 |
10 | 136606293 |
11 | 7012436a |
12 | 398ba699 |
13 | 223bc735 |
14 | 141dd8c5 |
15 | bed5e13 |
hex | 8247255 |
136606293 has 6 divisors (see below), whose sum is σ = 197320214. Its totient is φ = 91070856.
The previous prime is 136606291. The next prime is 136606303. The reversal of 136606293 is 392606631.
136606293 is a `hidden beast` number, since 1 + 366 + 0 + 6 + 293 = 666.
It can be written as a sum of positive squares in only one way, i.e., 83942244 + 52664049 = 9162^2 + 7257^2 .
It is not a de Polignac number, because 136606293 - 21 = 136606291 is a prime.
It is a super-2 number, since 2×1366062932 = 37322558574403698, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136606291) 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 in 5 ways as a sum of consecutive naturals, for example, 7589230 + ... + 7589247.
Almost surely, 2136606293 is an apocalyptic number.
It is an amenable number.
136606293 is a deficient number, since it is larger than the sum of its proper divisors (60713921).
136606293 is a wasteful number, since it uses less digits than its factorization.
136606293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15178483 (or 15178480 counting only the distinct ones).
The product of its (nonzero) digits is 34992, while the sum is 36.
The square root of 136606293 is about 11687.8694807908. The cubic root of 136606293 is about 515.0193765293.
The spelling of 136606293 in words is "one hundred thirty-six million, six hundred six thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •