Base | Representation |
---|---|
bin | 11111010001111101000 |
3 | 1221002000222 |
4 | 3322033220 |
5 | 230300000 |
6 | 33545212 |
7 | 11466224 |
oct | 3721750 |
9 | 1832028 |
10 | 1025000 |
11 | 640109 |
12 | 415208 |
13 | 29b712 |
14 | 1c9784 |
15 | 153a85 |
hex | fa3e8 |
1025000 has 48 divisors (see below), whose sum is σ = 2460780. Its totient is φ = 400000.
The previous prime is 1024997. The next prime is 1025009. The reversal of 1025000 is 5201.
It can be written as a sum of positive squares in 6 ways, for example, as 362404 + 662596 = 602^2 + 814^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1025009) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24980 + ... + 25020.
21025000 is an apocalyptic number.
1025000 is a gapful number since it is divisible by the number (10) 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 1025000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1230390).
1025000 is an abundant number, since it is smaller than the sum of its proper divisors (1435780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1025000 is an frugal number, since it uses more digits than its factorization.
1025000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72 (or 48 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 8.
The square root of 1025000 is about 1012.4228365658. The cubic root of 1025000 is about 100.8264837609.
It can be divided in two parts, 10 and 25000, that multiplied together give a square (250000 = 5002).
The spelling of 1025000 in words is "one million, twenty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •