Base | Representation |
---|---|
bin | 10000010000110… |
… | …00001101101101 |
3 | 100111200112220122 |
4 | 20020120031231 |
5 | 234410222221 |
6 | 21311454325 |
7 | 3244333430 |
oct | 1010301555 |
9 | 314615818 |
10 | 136414061 |
11 | 700029a3 |
12 | 398273a5 |
13 | 223530a4 |
14 | 1418d817 |
15 | be98eab |
hex | 821836d |
136414061 has 12 divisors (see below), whose sum is σ = 157124832. Its totient is φ = 116013936.
The previous prime is 136414027. The next prime is 136414063. The reversal of 136414061 is 160414631.
It is a de Polignac number, because none of the positive numbers 2k-136414061 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 136414061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136414063) 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, 465431 + ... + 465723.
It is an arithmetic number, because the mean of its divisors is an integer number (13093736).
Almost surely, 2136414061 is an apocalyptic number.
It is an amenable number.
136414061 is a deficient number, since it is larger than the sum of its proper divisors (20710771).
136414061 is an frugal number, since it uses more digits than its factorization.
136414061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 820 (or 527 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 26.
The square root of 136414061 is about 11679.6430168049. The cubic root of 136414061 is about 514.7776851743. Note that the first 3 decimals are identical.
Adding to 136414061 its reverse (160414631), we get a palindrome (296828692).
The spelling of 136414061 in words is "one hundred thirty-six million, four hundred fourteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •