Base | Representation |
---|---|
bin | 1000001000110111000 |
3 | 111112211001 |
4 | 1001012320 |
5 | 32013210 |
6 | 5414344 |
7 | 2160331 |
oct | 1010670 |
9 | 445731 |
10 | 266680 |
11 | 1723a7 |
12 | 10a3b4 |
13 | 944cb |
14 | 6d288 |
15 | 5403a |
hex | 411b8 |
266680 has 32 divisors (see below), whose sum is σ = 615600. Its totient is φ = 103936.
The previous prime is 266677. The next prime is 266681. The reversal of 266680 is 86662.
It is a happy number.
It is a super-2 number, since 2×2666802 = 142236444800, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (266681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2304 + ... + 2416.
2266680 is an apocalyptic number.
266680 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 266680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (307800).
266680 is an abundant number, since it is smaller than the sum of its proper divisors (348920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
266680 is a wasteful number, since it uses less digits than its factorization.
266680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183 (or 179 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 28.
The square root of 266680 is about 516.4106892774. The cubic root of 266680 is about 64.3670317218.
It can be divided in two parts, 266 and 680, that added together give a triangular number (946 = T43).
The spelling of 266680 in words is "two hundred sixty-six thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •