Base | Representation |
---|---|
bin | 101010011010… |
… | …111000011101 |
3 | 202220221222200 |
4 | 222122320131 |
5 | 10321321112 |
6 | 1034202113 |
7 | 163343166 |
oct | 52327035 |
9 | 22827880 |
10 | 11120157 |
11 | 6305814 |
12 | 3883339 |
13 | 23c4699 |
14 | 169676d |
15 | e99cdc |
hex | a9ae1d |
11120157 has 6 divisors (see below), whose sum is σ = 16062462. Its totient is φ = 7413432.
The previous prime is 11120147. The next prime is 11120167. The reversal of 11120157 is 75102111.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (11120147) and next prime (11120167).
It can be written as a sum of positive squares in only one way, i.e., 7901721 + 3218436 = 2811^2 + 1794^2 .
It is not a de Polignac number, because 11120157 - 210 = 11119133 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 617778 + ... + 617795.
It is an arithmetic number, because the mean of its divisors is an integer number (2677077).
Almost surely, 211120157 is an apocalyptic number.
It is an amenable number.
11120157 is a deficient number, since it is larger than the sum of its proper divisors (4942305).
11120157 is a wasteful number, since it uses less digits than its factorization.
11120157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1235579 (or 1235576 counting only the distinct ones).
The product of its (nonzero) digits is 70, while the sum is 18.
The square root of 11120157 is about 3334.6899406092. The cubic root of 11120157 is about 223.2048564288.
Adding to 11120157 its reverse (75102111), we get a palindrome (86222268).
The spelling of 11120157 in words is "eleven million, one hundred twenty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •