Base | Representation |
---|---|
bin | 10000010010100… |
… | …01100011101001 |
3 | 100112010111002202 |
4 | 20021101203221 |
5 | 234440231222 |
6 | 21320505545 |
7 | 3246332255 |
oct | 1011214351 |
9 | 315114082 |
10 | 136648937 |
11 | 70153407 |
12 | 3991b2b5 |
13 | 22405c79 |
14 | 14211265 |
15 | bee3892 |
hex | 82518e9 |
136648937 has 2 divisors, whose sum is σ = 136648938. Its totient is φ = 136648936.
The previous prime is 136648933. The next prime is 136648973. The reversal of 136648937 is 739846631.
It is a happy number.
Together with next prime (136648973) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 85082176 + 51566761 = 9224^2 + 7181^2 .
It is a cyclic number.
It is not a de Polignac number, because 136648937 - 22 = 136648933 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 136648891 and 136648900.
It is not a weakly prime, because it can be changed into another prime (136648933) 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, 68324468 + 68324469.
It is an arithmetic number, because the mean of its divisors is an integer number (68324469).
Almost surely, 2136648937 is an apocalyptic number.
It is an amenable number.
136648937 is a deficient number, since it is larger than the sum of its proper divisors (1).
136648937 is an equidigital number, since it uses as much as digits as its factorization.
136648937 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 653184, while the sum is 47.
The square root of 136648937 is about 11689.6936230168. The cubic root of 136648937 is about 515.0729616677.
The spelling of 136648937 in words is "one hundred thirty-six million, six hundred forty-eight thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •