Base | Representation |
---|---|
bin | 10000000001111… |
… | …00110011001001 |
3 | 100101000121201102 |
4 | 20000330303021 |
5 | 233410414021 |
6 | 21202031145 |
7 | 3221643242 |
oct | 1000746311 |
9 | 311017642 |
10 | 134466761 |
11 | 699a2960 |
12 | 390484b5 |
13 | 21b20940 |
14 | 13c03cc9 |
15 | bc1200b |
hex | 803ccc9 |
134466761 has 8 divisors (see below), whose sum is σ = 157975104. Its totient is φ = 112839120.
The previous prime is 134466751. The next prime is 134466779. The reversal of 134466761 is 167664431.
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 134466761 - 26 = 134466697 is a prime.
It is a super-2 number, since 2×1344667612 = 36162619627662242, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134466701) 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, 470021 + ... + 470306.
It is an arithmetic number, because the mean of its divisors is an integer number (19746888).
Almost surely, 2134466761 is an apocalyptic number.
134466761 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
134466761 is a deficient number, since it is larger than the sum of its proper divisors (23508343).
134466761 is a wasteful number, since it uses less digits than its factorization.
134466761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 940351.
The product of its digits is 72576, while the sum is 38.
The square root of 134466761 is about 11595.9803811493. The cubic root of 134466761 is about 512.3164661873.
The spelling of 134466761 in words is "one hundred thirty-four million, four hundred sixty-six thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •