Base | Representation |
---|---|
bin | 10000000010001… |
… | …11100000001101 |
3 | 100101002211212021 |
4 | 20001013200031 |
5 | 233413314410 |
6 | 21203010141 |
7 | 3222215125 |
oct | 1001074015 |
9 | 311084767 |
10 | 134510605 |
11 | 69a22899 |
12 | 39069951 |
13 | 21b37898 |
14 | 13c15c85 |
15 | bc1eeda |
hex | 804780d |
134510605 has 4 divisors (see below), whose sum is σ = 161412732. Its totient is φ = 107608480.
The previous prime is 134510587. The next prime is 134510609. The reversal of 134510605 is 506015431.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 506015431 = 6133 ⋅82507.
It can be written as a sum of positive squares in 2 ways, for example, as 96884649 + 37625956 = 9843^2 + 6134^2 .
It is not a de Polignac number, because 134510605 - 29 = 134510093 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 134510605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134510609) 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, 13451056 + ... + 13451065.
It is an arithmetic number, because the mean of its divisors is an integer number (40353183).
Almost surely, 2134510605 is an apocalyptic number.
It is an amenable number.
134510605 is a deficient number, since it is larger than the sum of its proper divisors (26902127).
134510605 is an equidigital number, since it uses as much as digits as its factorization.
134510605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26902126.
The product of its (nonzero) digits is 1800, while the sum is 25.
The square root of 134510605 is about 11597.8707097467. The cubic root of 134510605 is about 512.3721418108.
The spelling of 134510605 in words is "one hundred thirty-four million, five hundred ten thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •