Base | Representation |
---|---|
bin | 10000000010011… |
… | …10011111101001 |
3 | 100101011022010212 |
4 | 20001032133221 |
5 | 233420223431 |
6 | 21203350505 |
7 | 3222364454 |
oct | 1001163751 |
9 | 311138125 |
10 | 134539241 |
11 | 69a42361 |
12 | 39082435 |
13 | 21b47925 |
14 | 13c2249b |
15 | bc2872b |
hex | 804e7e9 |
134539241 has 4 divisors (see below), whose sum is σ = 142453332. Its totient is φ = 126625152.
The previous prime is 134539231. The next prime is 134539261. The reversal of 134539241 is 142935431.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 60217600 + 74321641 = 7760^2 + 8621^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134539241 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134539198 and 134539207.
It is not an unprimeable number, because it can be changed into a prime (134539201) 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 3 ways as a sum of consecutive naturals, for example, 3957020 + ... + 3957053.
It is an arithmetic number, because the mean of its divisors is an integer number (35613333).
Almost surely, 2134539241 is an apocalyptic number.
It is an amenable number.
134539241 is a deficient number, since it is larger than the sum of its proper divisors (7914091).
134539241 is an equidigital number, since it uses as much as digits as its factorization.
134539241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7914090.
The product of its digits is 12960, while the sum is 32.
The square root of 134539241 is about 11599.1051810043. The cubic root of 134539241 is about 512.4084989133.
The spelling of 134539241 in words is "one hundred thirty-four million, five hundred thirty-nine thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •