Base | Representation |
---|---|
bin | 1010000001000100101000 |
3 | 11221101222001 |
4 | 22001010220 |
5 | 1133011312 |
6 | 132140344 |
7 | 31214326 |
oct | 12010450 |
9 | 4841861 |
10 | 2625832 |
11 | 1533910 |
12 | a676b4 |
13 | 70c261 |
14 | 4c4d16 |
15 | 36d057 |
hex | 281128 |
2625832 has 32 divisors (see below), whose sum is σ = 5482080. Its totient is φ = 1168960.
The previous prime is 2625829. The next prime is 2625839. The reversal of 2625832 is 2385262.
It is a d-powerful number, because it can be written as 29 + 63 + 219 + 55 + 83 + 33 + 221 .
It is a self number, because there is not a number n which added to its sum of digits gives 2625832.
It is not an unprimeable number, because it can be changed into a prime (2625839) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4383 + ... + 4945.
It is an arithmetic number, because the mean of its divisors is an integer number (171315).
22625832 is an apocalyptic number.
2625832 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 2625832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2741040).
2625832 is an abundant number, since it is smaller than the sum of its proper divisors (2856248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2625832 is a wasteful number, since it uses less digits than its factorization.
2625832 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 633 (or 629 counting only the distinct ones).
The product of its digits is 5760, while the sum is 28.
The square root of 2625832 is about 1620.4419150343. The cubic root of 2625832 is about 137.9607814060.
The spelling of 2625832 in words is "two million, six hundred twenty-five thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •