Base | Representation |
---|---|
bin | 1001111111111000011100 |
3 | 11221011021110 |
4 | 21333320130 |
5 | 1132332311 |
6 | 132102020 |
7 | 31164162 |
oct | 11777034 |
9 | 4834243 |
10 | 2620956 |
11 | 1530188 |
12 | a64910 |
13 | 709c80 |
14 | 4c3232 |
15 | 36b8a6 |
hex | 27fe1c |
2620956 has 48 divisors (see below), whose sum is σ = 6731424. Its totient is φ = 788736.
The previous prime is 2620951. The next prime is 2620967. The reversal of 2620956 is 6590262.
2620956 is nontrivially palindromic in base 5.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2620951) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8110 + ... + 8426.
It is an arithmetic number, because the mean of its divisors is an integer number (140238).
22620956 is an apocalyptic number.
2620956 is a gapful number since it is divisible by the number (26) 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 2620956, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3365712).
2620956 is an abundant number, since it is smaller than the sum of its proper divisors (4110468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2620956 is a wasteful number, since it uses less digits than its factorization.
2620956 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 390 (or 388 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 30.
The square root of 2620956 is about 1618.9366880765. The cubic root of 2620956 is about 137.8753337479.
The spelling of 2620956 in words is "two million, six hundred twenty thousand, nine hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •