Base | Representation |
---|---|
bin | 10000000101001… |
… | …11110100010001 |
3 | 100101211220000101 |
4 | 20002213310101 |
5 | 234013430410 |
6 | 21215252401 |
7 | 3225450226 |
oct | 1002476421 |
9 | 311756011 |
10 | 134905105 |
11 | 6a172225 |
12 | 3921a101 |
13 | 21c4530a |
14 | 13cb994d |
15 | bc9bd3a |
hex | 80a7d11 |
134905105 has 8 divisors (see below), whose sum is σ = 162856512. Its totient is φ = 107277168.
The previous prime is 134905039. The next prime is 134905109. The reversal of 134905105 is 501509431.
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 134905105 - 211 = 134903057 is a prime.
It is a super-2 number, since 2×1349051052 = 36398774710122050, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134905109) 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 7 ways as a sum of consecutive naturals, for example, 79947 + ... + 81616.
It is an arithmetic number, because the mean of its divisors is an integer number (20357064).
Almost surely, 2134905105 is an apocalyptic number.
It is an amenable number.
134905105 is a deficient number, since it is larger than the sum of its proper divisors (27951407).
134905105 is a wasteful number, since it uses less digits than its factorization.
134905105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161735.
The product of its (nonzero) digits is 2700, while the sum is 28.
The square root of 134905105 is about 11614.8656901404. The cubic root of 134905105 is about 512.8725571859.
The spelling of 134905105 in words is "one hundred thirty-four million, nine hundred five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •