Base | Representation |
---|---|
bin | 1010100110110100110010 |
3 | 12020021002020 |
4 | 22212310302 |
5 | 1202433331 |
6 | 135332310 |
7 | 32430213 |
oct | 12466462 |
9 | 5207066 |
10 | 2780466 |
11 | 162a007 |
12 | b21096 |
13 | 764760 |
14 | 52540a |
15 | 39dc96 |
hex | 2a6d32 |
2780466 has 32 divisors (see below), whose sum is σ = 6135360. Its totient is φ = 834624.
The previous prime is 2780443. The next prime is 2780467. The reversal of 2780466 is 6640872.
2780466 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2780467) 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 15 ways as a sum of consecutive naturals, for example, 2940 + ... + 3768.
It is an arithmetic number, because the mean of its divisors is an integer number (191730).
22780466 is an apocalyptic number.
2780466 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 2780466, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3067680).
2780466 is an abundant number, since it is smaller than the sum of its proper divisors (3354894).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2780466 is a wasteful number, since it uses less digits than its factorization.
2780466 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 890.
The product of its (nonzero) digits is 16128, while the sum is 33.
The square root of 2780466 is about 1667.4729383111. The cubic root of 2780466 is about 140.6174429519.
The spelling of 2780466 in words is "two million, seven hundred eighty thousand, four hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •