Base | Representation |
---|---|
bin | 10000010100110… |
… | …10001101101101 |
3 | 100112200121100010 |
4 | 20022122031231 |
5 | 240024242131 |
6 | 21331123433 |
7 | 3252012024 |
oct | 1012321555 |
9 | 315617303 |
10 | 136946541 |
11 | 70336a66 |
12 | 39a43579 |
13 | 224ab574 |
14 | 1428b8bb |
15 | c051b46 |
hex | 829a36d |
136946541 has 8 divisors (see below), whose sum is σ = 186040800. Its totient is φ = 89574992.
The previous prime is 136946539. The next prime is 136946549. The reversal of 136946541 is 145649631.
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 136946541 - 21 = 136946539 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 136946541.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136946549) 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, 430491 + ... + 430808.
It is an arithmetic number, because the mean of its divisors is an integer number (23255100).
Almost surely, 2136946541 is an apocalyptic number.
It is an amenable number.
136946541 is a deficient number, since it is larger than the sum of its proper divisors (49094259).
136946541 is an equidigital number, since it uses as much as digits as its factorization.
136946541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 861355.
The product of its digits is 77760, while the sum is 39.
The square root of 136946541 is about 11702.4160325977. The cubic root of 136946541 is about 515.4466116720.
The spelling of 136946541 in words is "one hundred thirty-six million, nine hundred forty-six thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •