Base | Representation |
---|---|
bin | 101010001001… |
… | …111111101011 |
3 | 202210110002211 |
4 | 222021333223 |
5 | 10312112422 |
6 | 1032505551 |
7 | 162634423 |
oct | 52117753 |
9 | 22713084 |
10 | 11050987 |
11 | 6268852 |
12 | 384b2b7 |
13 | 239c05c |
14 | 1679483 |
15 | e84577 |
hex | a89feb |
11050987 has 4 divisors (see below), whose sum is σ = 11108440. Its totient is φ = 10993536.
The previous prime is 11050981. The next prime is 11050993. The reversal of 11050987 is 78905011.
11050987 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 78905011 = 7237 ⋅10903.
It is an interprime number because it is at equal distance from previous prime (11050981) and next prime (11050993).
It is a cyclic number.
It is not a de Polignac number, because 11050987 - 23 = 11050979 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11050981) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28437 + ... + 28822.
It is an arithmetic number, because the mean of its divisors is an integer number (2777110).
Almost surely, 211050987 is an apocalyptic number.
11050987 is a deficient number, since it is larger than the sum of its proper divisors (57453).
11050987 is an equidigital number, since it uses as much as digits as its factorization.
11050987 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57452.
The product of its (nonzero) digits is 2520, while the sum is 31.
The square root of 11050987 is about 3324.3024832286. The cubic root of 11050987 is about 222.7410979113.
Adding to 11050987 its reverse (78905011), we get a palindrome (89955998).
The spelling of 11050987 in words is "eleven million, fifty thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •