Base | Representation |
---|---|
bin | 11001010000111100000100 |
3 | 110110111000120 |
4 | 121100330010 |
5 | 3143413410 |
6 | 353541540 |
7 | 110202660 |
oct | 31207404 |
9 | 13414016 |
10 | 6622980 |
11 | 3813a41 |
12 | 22748b0 |
13 | 14ab730 |
14 | c458a0 |
15 | 8ac570 |
hex | 650f04 |
6622980 has 96 divisors (see below), whose sum is σ = 22842624. Its totient is φ = 1396224.
The previous prime is 6622961. The next prime is 6622981. The reversal of 6622980 is 892266.
6622980 is a nontrivial binomial coefficient, being equal to C(3640, 2).
It is not an unprimeable number, because it can be changed into a prime (6622981) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4854 + ... + 6066.
It is an arithmetic number, because the mean of its divisors is an integer number (237944).
Almost surely, 26622980 is an apocalyptic number.
6622980 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
6622980 is the 3639-th triangular number and also the 1820-th hexagonal number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6622980, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11421312).
6622980 is an abundant number, since it is smaller than the sum of its proper divisors (16219644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6622980 is a wasteful number, since it uses less digits than its factorization.
6622980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1245 (or 1243 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 33.
The square root of 6622980 is about 2573.5151058426. The cubic root of 6622980 is about 187.7951972242.
The spelling of 6622980 in words is "six million, six hundred twenty-two thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •