Base | Representation |
---|---|
bin | 10000010000011… |
… | …01010000000001 |
3 | 100111121021022101 |
4 | 20020031100001 |
5 | 234402303103 |
6 | 21310510401 |
7 | 3244055464 |
oct | 1010152001 |
9 | 314537271 |
10 | 136369153 |
11 | 6aa82188 |
12 | 39805401 |
13 | 2233880b |
14 | 1417b2db |
15 | be8aa1d |
hex | 820d401 |
136369153 has 4 divisors (see below), whose sum is σ = 137157588. Its totient is φ = 135580720.
The previous prime is 136369141. The next prime is 136369193. The reversal of 136369153 is 351963631.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 351963631 = 17 ⋅20703743.
It can be written as a sum of positive squares in 2 ways, for example, as 126180289 + 10188864 = 11233^2 + 3192^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-136369153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (136369193) 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 in 3 ways as a sum of consecutive naturals, for example, 393958 + ... + 394303.
It is an arithmetic number, because the mean of its divisors is an integer number (34289397).
Almost surely, 2136369153 is an apocalyptic number.
It is an amenable number.
136369153 is a deficient number, since it is larger than the sum of its proper divisors (788435).
136369153 is an equidigital number, since it uses as much as digits as its factorization.
136369153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 788434.
The product of its digits is 43740, while the sum is 37.
The square root of 136369153 is about 11677.7203682911. The cubic root of 136369153 is about 514.7211900853.
The spelling of 136369153 in words is "one hundred thirty-six million, three hundred sixty-nine thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •