Base | Representation |
---|---|
bin | 10000010100000… |
… | …10101011101001 |
3 | 100112111201010012 |
4 | 20022002223221 |
5 | 240013201103 |
6 | 21325101305 |
7 | 3251131016 |
oct | 1012025351 |
9 | 315451105 |
10 | 136850153 |
11 | 70280600 |
12 | 399b7835 |
13 | 2247672b |
14 | 1426470d |
15 | c0332d8 |
hex | 8282ae9 |
136850153 has 12 divisors (see below), whose sum is σ = 159272820. Its totient is φ = 117089280.
The previous prime is 136850143. The next prime is 136850167. The reversal of 136850153 is 351058631.
It can be written as a sum of positive squares in 2 ways, for example, as 109893289 + 26956864 = 10483^2 + 5192^2 .
It is not a de Polignac number, because 136850153 - 24 = 136850137 is a prime.
It is a super-2 number, since 2×1368501532 = 37455928752246818, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (136850143) 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 in 11 ways as a sum of consecutive naturals, for example, 31208 + ... + 35321.
It is an arithmetic number, because the mean of its divisors is an integer number (13272735).
Almost surely, 2136850153 is an apocalyptic number.
It is an amenable number.
136850153 is a deficient number, since it is larger than the sum of its proper divisors (22422667).
136850153 is a wasteful number, since it uses less digits than its factorization.
136850153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66568 (or 66557 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 32.
The square root of 136850153 is about 11698.2970128134. The cubic root of 136850153 is about 515.3256532104.
The spelling of 136850153 in words is "one hundred thirty-six million, eight hundred fifty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •