Base | Representation |
---|---|
bin | 101010001001… |
… | …110100001101 |
3 | 202210102002122 |
4 | 222021310031 |
5 | 10312102003 |
6 | 1032502325 |
7 | 162632324 |
oct | 52116415 |
9 | 22712078 |
10 | 11050253 |
11 | 6268245 |
12 | 384a9a5 |
13 | 239b916 |
14 | 16790bb |
15 | e84238 |
hex | a89d0d |
11050253 has 4 divisors (see below), whose sum is σ = 11061660. Its totient is φ = 11038848.
The previous prime is 11050241. The next prime is 11050261. The reversal of 11050253 is 35205011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 35205011 = 17 ⋅2070883.
It can be written as a sum of positive squares in 2 ways, for example, as 2365444 + 8684809 = 1538^2 + 2947^2 .
It is a cyclic number.
It is not a de Polignac number, because 11050253 - 210 = 11049229 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11050213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4100 + ... + 6237.
It is an arithmetic number, because the mean of its divisors is an integer number (2765415).
Almost surely, 211050253 is an apocalyptic number.
It is an amenable number.
11050253 is a deficient number, since it is larger than the sum of its proper divisors (11407).
11050253 is a wasteful number, since it uses less digits than its factorization.
11050253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11406.
The product of its (nonzero) digits is 150, while the sum is 17.
The square root of 11050253 is about 3324.1920822961. The cubic root of 11050253 is about 222.7361663582.
Adding to 11050253 its reverse (35205011), we get a palindrome (46255264).
The spelling of 11050253 in words is "eleven million, fifty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •