Base | Representation |
---|---|
bin | 11111010010010000101 |
3 | 1221002020210 |
4 | 3322102011 |
5 | 230301112 |
6 | 33550033 |
7 | 11466540 |
oct | 3722205 |
9 | 1832223 |
10 | 1025157 |
11 | 640241 |
12 | 415319 |
13 | 29b803 |
14 | 1c9857 |
15 | 153b3c |
hex | fa485 |
1025157 has 8 divisors (see below), whose sum is σ = 1562176. Its totient is φ = 585792.
The previous prime is 1025153. The next prime is 1025161. The reversal of 1025157 is 7515201.
1025157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (1025153) and next prime (1025161).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1025157 - 22 = 1025153 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 48817 = 1025157 / (1 + 0 + 2 + 5 + 1 + 5 + 7).
It is the 1013-rd Hogben number.
It is a zygodrome in base 6.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1025153) 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, 24388 + ... + 24429.
It is an arithmetic number, because the mean of its divisors is an integer number (195272).
21025157 is an apocalyptic number.
It is an amenable number.
1025157 is a deficient number, since it is larger than the sum of its proper divisors (537019).
1025157 is an equidigital number, since it uses as much as digits as its factorization.
1025157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48827.
The product of its (nonzero) digits is 350, while the sum is 21.
The square root of 1025157 is about 1012.5003703703. The cubic root of 1025157 is about 100.8316313869.
The spelling of 1025157 in words is "one million, twenty-five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •