Base | Representation |
---|---|
bin | 1010000111000010100000 |
3 | 11222122111020 |
4 | 22013002200 |
5 | 1134302042 |
6 | 132445440 |
7 | 31345512 |
oct | 12070240 |
9 | 4878436 |
10 | 2650272 |
11 | 1550209 |
12 | a79880 |
13 | 71a411 |
14 | 4cdbb2 |
15 | 3753ec |
hex | 2870a0 |
2650272 has 48 divisors (see below), whose sum is σ = 7328160. Its totient is φ = 836352.
The previous prime is 2650259. The next prime is 2650301. The reversal of 2650272 is 2720562.
2650272 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
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, 1098 + ... + 2550.
It is an arithmetic number, because the mean of its divisors is an integer number (152670).
22650272 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2650272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3664080).
2650272 is an abundant number, since it is smaller than the sum of its proper divisors (4677888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2650272 is a wasteful number, since it uses less digits than its factorization.
2650272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1485 (or 1477 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 24.
The square root of 2650272 is about 1627.9656016022. The cubic root of 2650272 is about 138.3874848073.
The spelling of 2650272 in words is "two million, six hundred fifty thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •