Base | Representation |
---|---|
bin | 11111010010000101110 |
3 | 1221002010120 |
4 | 3322100232 |
5 | 230300240 |
6 | 33545410 |
7 | 11466354 |
oct | 3722056 |
9 | 1832116 |
10 | 1025070 |
11 | 640172 |
12 | 415266 |
13 | 29b767 |
14 | 1c97d4 |
15 | 153ad0 |
hex | fa42e |
1025070 has 32 divisors (see below), whose sum is σ = 2515968. Its totient is φ = 267168.
The previous prime is 1025047. The next prime is 1025081. The reversal of 1025070 is 705201.
It is a happy number.
It is a super-3 number, since 3×10250703 = 3231333813953529000, which contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1047 + ... + 1773.
It is an arithmetic number, because the mean of its divisors is an integer number (78624).
21025070 is an apocalyptic number.
1025070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1025070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1257984).
1025070 is an abundant number, since it is smaller than the sum of its proper divisors (1490898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1025070 is a wasteful number, since it uses less digits than its factorization.
1025070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 784.
The product of its (nonzero) digits is 70, while the sum is 15.
The square root of 1025070 is about 1012.4574065115. The cubic root of 1025070 is about 100.8287789457.
The spelling of 1025070 in words is "one million, twenty-five thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •