Base | Representation |
---|---|
bin | 10000010100110… |
… | …00110000010001 |
3 | 100112200022010122 |
4 | 20022120300101 |
5 | 240024044221 |
6 | 21331040025 |
7 | 3251655422 |
oct | 1012306021 |
9 | 315608118 |
10 | 136940561 |
11 | 7033251a |
12 | 39a40015 |
13 | 224a8924 |
14 | 14289649 |
15 | c04eeab |
hex | 8298c11 |
136940561 has 2 divisors, whose sum is σ = 136940562. Its totient is φ = 136940560.
The previous prime is 136940537. The next prime is 136940567. The reversal of 136940561 is 165049631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 131446225 + 5494336 = 11465^2 + 2344^2 .
It is a cyclic number.
It is not a de Polignac number, because 136940561 - 26 = 136940497 is a prime.
It is a super-3 number, since 3×1369405613 (a number of 25 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (136940567) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68470280 + 68470281.
It is an arithmetic number, because the mean of its divisors is an integer number (68470281).
Almost surely, 2136940561 is an apocalyptic number.
It is an amenable number.
136940561 is a deficient number, since it is larger than the sum of its proper divisors (1).
136940561 is an equidigital number, since it uses as much as digits as its factorization.
136940561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 35.
The square root of 136940561 is about 11702.1605270138. The cubic root of 136940561 is about 515.4391089497.
The spelling of 136940561 in words is "one hundred thirty-six million, nine hundred forty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •