Base | Representation |
---|---|
bin | 1000010000100110100101 |
3 | 11002000001000 |
4 | 20100212211 |
5 | 1023241112 |
6 | 114223513 |
7 | 24255261 |
oct | 10204645 |
9 | 4060030 |
10 | 2165157 |
11 | 1249795 |
12 | 884b99 |
13 | 5aa677 |
14 | 4050a1 |
15 | 2cb7dc |
hex | 2109a5 |
2165157 has 8 divisors (see below), whose sum is σ = 3207680. Its totient is φ = 1443420.
The previous prime is 2165147. The next prime is 2165159. The reversal of 2165157 is 7515612.
2165157 is a `hidden beast` number, since 2 + 1 + 651 + 5 + 7 = 666.
It is not a de Polignac number, because 2165157 - 27 = 2165029 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 80191 = 2165157 / (2 + 1 + 6 + 5 + 1 + 5 + 7).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2165157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2165159) 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, 40069 + ... + 40122.
It is an arithmetic number, because the mean of its divisors is an integer number (400960).
22165157 is an apocalyptic number.
2165157 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
It is an amenable number.
2165157 is a deficient number, since it is larger than the sum of its proper divisors (1042523).
2165157 is an equidigital number, since it uses as much as digits as its factorization.
2165157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80200 (or 80194 counting only the distinct ones).
The product of its digits is 2100, while the sum is 27.
The square root of 2165157 is about 1471.4472467608. The cubic root of 2165157 is about 129.3688738960.
The spelling of 2165157 in words is "two million, one hundred sixty-five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •