Base | Representation |
---|---|
bin | 101010011001… |
… | …111000010101 |
3 | 202220202100200 |
4 | 222121320111 |
5 | 10321203203 |
6 | 1034131113 |
7 | 163325214 |
oct | 52317025 |
9 | 22822320 |
10 | 11116053 |
11 | 6302723 |
12 | 3880a99 |
13 | 23c2860 |
14 | 169507b |
15 | e989a3 |
hex | a99e15 |
11116053 has 12 divisors (see below), whose sum is σ = 17291820. Its totient is φ = 6840576.
The previous prime is 11116031. The next prime is 11116057. The reversal of 11116053 is 35061111.
11116053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 2490084 + 8625969 = 1578^2 + 2937^2 .
It is not a de Polignac number, because 11116053 - 26 = 11115989 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11116057) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 47388 + ... + 47621.
It is an arithmetic number, because the mean of its divisors is an integer number (1440985).
Almost surely, 211116053 is an apocalyptic number.
11116053 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11116053 is a deficient number, since it is larger than the sum of its proper divisors (6175767).
11116053 is a wasteful number, since it uses less digits than its factorization.
11116053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95028 (or 95025 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 18.
The square root of 11116053 is about 3334.0745342598. The cubic root of 11116053 is about 223.1773944231.
Adding to 11116053 its reverse (35061111), we get a palindrome (46177164).
The spelling of 11116053 in words is "eleven million, one hundred sixteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •