Base | Representation |
---|---|
bin | 10000000010000… |
… | …01001111001101 |
3 | 100101001112122202 |
4 | 20001001033031 |
5 | 233412004231 |
6 | 21202251245 |
7 | 3222050243 |
oct | 1001011715 |
9 | 311045582 |
10 | 134484941 |
11 | 69a05588 |
12 | 39056b25 |
13 | 21b28cb6 |
14 | 13c0a793 |
15 | bc175cb |
hex | 80413cd |
134484941 has 4 divisors (see below), whose sum is σ = 134824092. Its totient is φ = 134145792.
The previous prime is 134484923. The next prime is 134484953. The reversal of 134484941 is 149484431.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 149484431 = 191 ⋅782641.
It can be written as a sum of positive squares in 2 ways, for example, as 100600900 + 33884041 = 10030^2 + 5821^2 .
It is a cyclic number.
It is not a de Polignac number, because 134484941 - 26 = 134484877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134484895 and 134484904.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134484241) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 168980 + ... + 169773.
It is an arithmetic number, because the mean of its divisors is an integer number (33706023).
Almost surely, 2134484941 is an apocalyptic number.
It is an amenable number.
134484941 is a deficient number, since it is larger than the sum of its proper divisors (339151).
134484941 is an equidigital number, since it uses as much as digits as its factorization.
134484941 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 339150.
The product of its digits is 55296, while the sum is 38.
The square root of 134484941 is about 11596.7642469786. The cubic root of 134484941 is about 512.3395536615.
The spelling of 134484941 in words is "one hundred thirty-four million, four hundred eighty-four thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •