Base | Representation |
---|---|
bin | 10000010010101… |
… | …01010001010011 |
3 | 100112011020222002 |
4 | 20021111101103 |
5 | 234441223042 |
6 | 21321104215 |
7 | 3246424514 |
oct | 1011252123 |
9 | 315136862 |
10 | 136664147 |
11 | 70163884 |
12 | 3992806b |
13 | 2240cb79 |
14 | 14216a0b |
15 | bee8132 |
hex | 8255453 |
136664147 has 2 divisors, whose sum is σ = 136664148. Its totient is φ = 136664146.
The previous prime is 136664123. The next prime is 136664149. The reversal of 136664147 is 741466631.
It is a strong prime.
It is an emirp because it is prime and its reverse (741466631) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 136664147 - 26 = 136664083 is a prime.
Together with 136664149, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 136664147.
It is not a weakly prime, because it can be changed into another prime (136664149) 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, 68332073 + 68332074.
It is an arithmetic number, because the mean of its divisors is an integer number (68332074).
Almost surely, 2136664147 is an apocalyptic number.
136664147 is a deficient number, since it is larger than the sum of its proper divisors (1).
136664147 is an equidigital number, since it uses as much as digits as its factorization.
136664147 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 72576, while the sum is 38.
The square root of 136664147 is about 11690.3441779958. The cubic root of 136664147 is about 515.0920713885.
The spelling of 136664147 in words is "one hundred thirty-six million, six hundred sixty-four thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •