Base | Representation |
---|---|
bin | 10000010100100… |
… | …10011101101101 |
3 | 100112121222210102 |
4 | 20022102131231 |
5 | 240022233142 |
6 | 21330320445 |
7 | 3251520335 |
oct | 1012223555 |
9 | 315558712 |
10 | 136914797 |
11 | 70315128 |
12 | 39a29125 |
13 | 22499c96 |
14 | 142800c5 |
15 | c047532 |
hex | 829276d |
136914797 has 2 divisors, whose sum is σ = 136914798. Its totient is φ = 136914796.
The previous prime is 136914733. The next prime is 136914851. The reversal of 136914797 is 797419631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 126585001 + 10329796 = 11251^2 + 3214^2 .
It is an emirp because it is prime and its reverse (797419631) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 136914797 - 26 = 136914733 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136914497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68457398 + 68457399.
It is an arithmetic number, because the mean of its divisors is an integer number (68457399).
Almost surely, 2136914797 is an apocalyptic number.
It is an amenable number.
136914797 is a deficient number, since it is larger than the sum of its proper divisors (1).
136914797 is an equidigital number, since it uses as much as digits as its factorization.
136914797 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 285768, while the sum is 47.
The square root of 136914797 is about 11701.0596528691. The cubic root of 136914797 is about 515.4067820141.
The spelling of 136914797 in words is "one hundred thirty-six million, nine hundred fourteen thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •