Base | Representation |
---|---|
bin | 10000000011011… |
… | …01100111011001 |
3 | 100101101210000001 |
4 | 20001231213121 |
5 | 233433313323 |
6 | 21210213001 |
7 | 3223435216 |
oct | 1001554731 |
9 | 311353001 |
10 | 134666713 |
11 | 6a01a105 |
12 | 39124161 |
13 | 21b9095c |
14 | 13c56b0d |
15 | bc513ad |
hex | 806d9d9 |
134666713 has 4 divisors (see below), whose sum is σ = 134691300. Its totient is φ = 134642128.
The previous prime is 134666689. The next prime is 134666723. The reversal of 134666713 is 317666431.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 317666431 = 349 ⋅910219.
It can be written as a sum of positive squares in 2 ways, for example, as 51437584 + 83229129 = 7172^2 + 9123^2 .
It is a cyclic number.
It is not a de Polignac number, because 134666713 - 217 = 134535641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134666723) 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, 63 + ... + 16411.
It is an arithmetic number, because the mean of its divisors is an integer number (33672825).
Almost surely, 2134666713 is an apocalyptic number.
It is an amenable number.
134666713 is a deficient number, since it is larger than the sum of its proper divisors (24587).
134666713 is an equidigital number, since it uses as much as digits as its factorization.
134666713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24586.
The product of its digits is 54432, while the sum is 37.
The square root of 134666713 is about 11604.5987866880. The cubic root of 134666713 is about 512.5702785242.
The spelling of 134666713 in words is "one hundred thirty-four million, six hundred sixty-six thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •