Base | Representation |
---|---|
bin | 1111111111111… |
… | …01111110111001 |
3 | 100100112112202221 |
4 | 13333331332321 |
5 | 233324200330 |
6 | 21152324041 |
7 | 3216522145 |
oct | 777757671 |
9 | 310475687 |
10 | 134209465 |
11 | 69837615 |
12 | 38b43621 |
13 | 21a607b0 |
14 | 13b78225 |
15 | bbb0b7a |
hex | 7ffdfb9 |
134209465 has 8 divisors (see below), whose sum is σ = 173440008. Its totient is φ = 99108480.
The previous prime is 134209463. The next prime is 134209489. The reversal of 134209465 is 564902431.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1982464 + 132227001 = 1408^2 + 11499^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 134209465 - 21 = 134209463 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 134209465.
It is not an unprimeable number, because it can be changed into a prime (134209463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1032316 + ... + 1032445.
It is an arithmetic number, because the mean of its divisors is an integer number (21680001).
Almost surely, 2134209465 is an apocalyptic number.
It is an amenable number.
134209465 is a deficient number, since it is larger than the sum of its proper divisors (39230543).
134209465 is a wasteful number, since it uses less digits than its factorization.
134209465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2064779.
The product of its (nonzero) digits is 25920, while the sum is 34.
The square root of 134209465 is about 11584.8808798364. The cubic root of 134209465 is about 511.9894928365.
The spelling of 134209465 in words is "one hundred thirty-four million, two hundred nine thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •