Base | Representation |
---|---|
bin | 10000001110110… |
… | …11000011011001 |
3 | 100111012211021021 |
4 | 20013123003121 |
5 | 234324213140 |
6 | 21302242441 |
7 | 3242241160 |
oct | 1007330331 |
9 | 314184237 |
10 | 136163545 |
11 | 6a951761 |
12 | 39726421 |
13 | 2229605b |
14 | 141263d7 |
15 | be49b4a |
hex | 81db0d9 |
136163545 has 8 divisors (see below), whose sum is σ = 186738624. Its totient is φ = 93369264.
The previous prime is 136163527. The next prime is 136163549. The reversal of 136163545 is 545361631.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 136163545 - 215 = 136130777 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 136163545.
It is not an unprimeable number, because it can be changed into a prime (136163549) 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 in 7 ways as a sum of consecutive naturals, for example, 1945159 + ... + 1945228.
It is an arithmetic number, because the mean of its divisors is an integer number (23342328).
Almost surely, 2136163545 is an apocalyptic number.
It is an amenable number.
136163545 is a deficient number, since it is larger than the sum of its proper divisors (50575079).
136163545 is an equidigital number, since it uses as much as digits as its factorization.
136163545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3890399.
The product of its digits is 32400, while the sum is 34.
The square root of 136163545 is about 11668.9136169568. The cubic root of 136163545 is about 514.4623729339.
It can be divided in two parts, 13616 and 3545, that added together give a square (17161 = 1312).
The spelling of 136163545 in words is "one hundred thirty-six million, one hundred sixty-three thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •