Base | Representation |
---|---|
bin | 1010001010110110010000 |
3 | 12000102220000 |
4 | 22022312100 |
5 | 1140301442 |
6 | 133050000 |
7 | 31442136 |
oct | 12126620 |
9 | 5012800 |
10 | 2665872 |
11 | 1560a00 |
12 | a86900 |
13 | 724551 |
14 | 4d5756 |
15 | 379d4c |
hex | 28ad90 |
2665872 has 150 divisors (see below), whose sum is σ = 8979894. Its totient is φ = 760320.
The previous prime is 2665867. The next prime is 2665879. The reversal of 2665872 is 2785662.
It can be written as a sum of positive squares in only one way, i.e., 2509056 + 156816 = 1584^2 + 396^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a d-powerful number, because it can be written as 217 + 62 + 65 + 59 + 85 + 75 + 219 .
It is not an unprimeable number, because it can be changed into a prime (2665879) by changing a digit.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 156808 + ... + 156824.
22665872 is an apocalyptic number.
2665872 is a gapful number since it is divisible by the number (22) 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 2665872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4489947).
2665872 is an abundant number, since it is smaller than the sum of its proper divisors (6314022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2665872 is a wasteful number, since it uses less digits than its factorization.
2665872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59 (or 33 counting only the distinct ones).
The product of its digits is 40320, while the sum is 36.
The square root of 2665872 is about 1632.7498277446. The cubic root of 2665872 is about 138.6584787243.
The spelling of 2665872 in words is "two million, six hundred sixty-five thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •