Base | Representation |
---|---|
bin | 1001110011111011100000 |
3 | 11211200010021 |
4 | 21303323200 |
5 | 1124301000 |
6 | 131043224 |
7 | 30601354 |
oct | 11637340 |
9 | 4750107 |
10 | 2572000 |
11 | 14a7422 |
12 | a40514 |
13 | 6c08c2 |
14 | 4ad464 |
15 | 35c11a |
hex | 273ee0 |
2572000 has 48 divisors (see below), whose sum is σ = 6329232. Its totient is φ = 1027200.
The previous prime is 2571979. The next prime is 2572001. The reversal of 2572000 is 2752.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2572001) 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, 3679 + ... + 4321.
It is an arithmetic number, because the mean of its divisors is an integer number (131859).
22572000 is an apocalyptic number.
2572000 is a gapful number since it is divisible by the number (20) 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 2572000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3164616).
2572000 is an abundant number, since it is smaller than the sum of its proper divisors (3757232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2572000 is an equidigital number, since it uses as much as digits as its factorization.
2572000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 668 (or 650 counting only the distinct ones).
The product of its (nonzero) digits is 140, while the sum is 16.
The square root of 2572000 is about 1603.7456157384. The cubic root of 2572000 is about 137.0114896148.
Adding to 2572000 its reverse (2752), we get a palindrome (2574752).
The spelling of 2572000 in words is "two million, five hundred seventy-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •