Base | Representation |
---|---|
bin | 10000010001100… |
… | …00110101111101 |
3 | 100111212200021221 |
4 | 20020300311331 |
5 | 234421434231 |
6 | 21313553341 |
7 | 3245233513 |
oct | 1010606575 |
9 | 314780257 |
10 | 136514941 |
11 | 70071772 |
12 | 39875851 |
13 | 22389c94 |
14 | 141b84b3 |
15 | beb8d11 |
hex | 8230d7d |
136514941 has 8 divisors (see below), whose sum is σ = 140544824. Its totient is φ = 132503040.
The previous prime is 136514927. The next prime is 136514951. The reversal of 136514941 is 149415631.
It can be written as a sum of positive squares in 4 ways, for example, as 19766916 + 116748025 = 4446^2 + 10805^2 .
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 136514941 - 27 = 136514813 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 136514897 and 136514906.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136514951) 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, 11761 + ... + 20281.
It is an arithmetic number, because the mean of its divisors is an integer number (17568103).
Almost surely, 2136514941 is an apocalyptic number.
It is an amenable number.
136514941 is a deficient number, since it is larger than the sum of its proper divisors (4029883).
136514941 is an equidigital number, since it uses as much as digits as its factorization.
136514941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8991.
The product of its digits is 12960, while the sum is 34.
The square root of 136514941 is about 11683.9608438235. The cubic root of 136514941 is about 514.9045488730.
The spelling of 136514941 in words is "one hundred thirty-six million, five hundred fourteen thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •