Base | Representation |
---|---|
bin | 11111010010111000000 |
3 | 1221002200110 |
4 | 3322113000 |
5 | 230303342 |
6 | 33551320 |
7 | 11500500 |
oct | 3722700 |
9 | 1832613 |
10 | 1025472 |
11 | 6404a8 |
12 | 415540 |
13 | 29b9b6 |
14 | 1c9a00 |
15 | 153c9c |
hex | fa5c0 |
1025472 has 84 divisors (see below), whose sum is σ = 3185160. Its totient is φ = 290304.
The previous prime is 1025459. The next prime is 1025477. The reversal of 1025472 is 2745201.
1025472 is digitally balanced in base 2, 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 (84).
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1025477) 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, 9354 + ... + 9462.
21025472 is an apocalyptic number.
1025472 is a gapful number since it is divisible by the number (12) 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 1025472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1592580).
1025472 is an abundant number, since it is smaller than the sum of its proper divisors (2159688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1025472 is a wasteful number, since it uses less digits than its factorization.
1025472 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138 (or 121 counting only the distinct ones).
The product of its (nonzero) digits is 560, while the sum is 21.
The square root of 1025472 is about 1012.6559139214. The cubic root of 1025472 is about 100.8419578413.
The spelling of 1025472 in words is "one million, twenty-five thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •