Base | Representation |
---|---|
bin | 10000010000000… |
… | …01011111001011 |
3 | 100111111211012212 |
4 | 20020001133023 |
5 | 234344232341 |
6 | 21305455335 |
7 | 3243465143 |
oct | 1010013713 |
9 | 314454185 |
10 | 136320971 |
11 | 6aa49a66 |
12 | 397a154b |
13 | 2231c8c7 |
14 | 14167923 |
15 | be7b5eb |
hex | 82017cb |
136320971 has 2 divisors, whose sum is σ = 136320972. Its totient is φ = 136320970.
The previous prime is 136320917. The next prime is 136320973. The reversal of 136320971 is 179023631.
It is a happy number.
Together with previous prime (136320917) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is an emirp because it is prime and its reverse (179023631) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-136320971 is a prime.
Together with 136320973, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (136320973) 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, 68160485 + 68160486.
It is an arithmetic number, because the mean of its divisors is an integer number (68160486).
Almost surely, 2136320971 is an apocalyptic number.
136320971 is a deficient number, since it is larger than the sum of its proper divisors (1).
136320971 is an equidigital number, since it uses as much as digits as its factorization.
136320971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 32.
The square root of 136320971 is about 11675.6571977769. The cubic root of 136320971 is about 514.6605624502.
The spelling of 136320971 in words is "one hundred thirty-six million, three hundred twenty thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •