Base | Representation |
---|---|
bin | 10000010001001… |
… | …00000010010001 |
3 | 100111210000022222 |
4 | 20020210002101 |
5 | 234413244411 |
6 | 21312510425 |
7 | 3244624541 |
oct | 1010440221 |
9 | 314700288 |
10 | 136462481 |
11 | 70036311 |
12 | 3984b415 |
13 | 2236c13c |
14 | 141a3321 |
15 | bea84db |
hex | 8224091 |
136462481 has 2 divisors, whose sum is σ = 136462482. Its totient is φ = 136462480.
The previous prime is 136462471. The next prime is 136462483. The reversal of 136462481 is 184264631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104878081 + 31584400 = 10241^2 + 5620^2 .
It is a cyclic number.
It is not a de Polignac number, because 136462481 - 226 = 69353617 is a prime.
It is a super-2 number, since 2×1364624812 = 37244017441350722, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 136462483, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (136462483) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68231240 + 68231241.
It is an arithmetic number, because the mean of its divisors is an integer number (68231241).
Almost surely, 2136462481 is an apocalyptic number.
It is an amenable number.
136462481 is a deficient number, since it is larger than the sum of its proper divisors (1).
136462481 is an equidigital number, since it uses as much as digits as its factorization.
136462481 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 27648, while the sum is 35.
The square root of 136462481 is about 11681.7156702258. The cubic root of 136462481 is about 514.8385845343.
The spelling of 136462481 in words is "one hundred thirty-six million, four hundred sixty-two thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •