Base | Representation |
---|---|
bin | 101010001000… |
… | …100010111101 |
3 | 202210010222001 |
4 | 222020202331 |
5 | 10311420203 |
6 | 1032422301 |
7 | 162611215 |
oct | 52104275 |
9 | 22703861 |
10 | 11045053 |
11 | 6264348 |
12 | 3847991 |
13 | 2399446 |
14 | 1677245 |
15 | e8291d |
hex | a888bd |
11045053 has 4 divisors (see below), whose sum is σ = 11694780. Its totient is φ = 10395328.
The previous prime is 11045051. The next prime is 11045093. The reversal of 11045053 is 35054011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 9872164 + 1172889 = 3142^2 + 1083^2 .
It is a cyclic number.
It is not a de Polignac number, because 11045053 - 21 = 11045051 is a prime.
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 11045053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11045051) 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, 324838 + ... + 324871.
It is an arithmetic number, because the mean of its divisors is an integer number (2923695).
Almost surely, 211045053 is an apocalyptic number.
It is an amenable number.
11045053 is a deficient number, since it is larger than the sum of its proper divisors (649727).
11045053 is an equidigital number, since it uses as much as digits as its factorization.
11045053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 649726.
The product of its (nonzero) digits is 300, while the sum is 19.
The square root of 11045053 is about 3323.4098453245. The cubic root of 11045053 is about 222.7012226699.
Adding to 11045053 its reverse (35054011), we get a palindrome (46099064).
The spelling of 11045053 in words is "eleven million, forty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •