Base | Representation |
---|---|
bin | 10000010010000… |
… | …11001100111111 |
3 | 100112000111110012 |
4 | 20021003030333 |
5 | 234431341033 |
6 | 21315333435 |
7 | 3245665664 |
oct | 1011031477 |
9 | 315014405 |
10 | 136590143 |
11 | 70113218 |
12 | 398b127b |
13 | 223b5291 |
14 | 141d7a6b |
15 | bed1248 |
hex | 824333f |
136590143 has 2 divisors, whose sum is σ = 136590144. Its totient is φ = 136590142.
The previous prime is 136590127. The next prime is 136590161. The reversal of 136590143 is 341095631.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 136590143 - 24 = 136590127 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136590193) 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, 68295071 + 68295072.
It is an arithmetic number, because the mean of its divisors is an integer number (68295072).
Almost surely, 2136590143 is an apocalyptic number.
136590143 is a deficient number, since it is larger than the sum of its proper divisors (1).
136590143 is an equidigital number, since it uses as much as digits as its factorization.
136590143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 32.
The square root of 136590143 is about 11687.1785731202. The cubic root of 136590143 is about 514.9990800247. Note that the first 3 decimals are identical.
The spelling of 136590143 in words is "one hundred thirty-six million, five hundred ninety thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •