Base | Representation |
---|---|
bin | 101010001010… |
… | …010010010111 |
3 | 202210111202010 |
4 | 222022102113 |
5 | 10312132213 |
6 | 1032515303 |
7 | 162641052 |
oct | 52122227 |
9 | 22714663 |
10 | 11052183 |
11 | 626973a |
12 | 384bb33 |
13 | 239c76c |
14 | 1679a99 |
15 | e84ac3 |
hex | a8a497 |
11052183 has 4 divisors (see below), whose sum is σ = 14736248. Its totient is φ = 7368120.
The previous prime is 11052169. The next prime is 11052187. The reversal of 11052183 is 38125011.
11052183 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: 38125011 = 3 ⋅12708337.
It is a de Polignac number, because none of the positive numbers 2k-11052183 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 (11052187) 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, 1842028 + ... + 1842033.
It is an arithmetic number, because the mean of its divisors is an integer number (3684062).
Almost surely, 211052183 is an apocalyptic number.
11052183 is a deficient number, since it is larger than the sum of its proper divisors (3684065).
11052183 is an equidigital number, since it uses as much as digits as its factorization.
11052183 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3684064.
The product of its (nonzero) digits is 240, while the sum is 21.
The square root of 11052183 is about 3324.4823657225. The cubic root of 11052183 is about 222.7491330531.
Adding to 11052183 its reverse (38125011), we get a palindrome (49177194).
The spelling of 11052183 in words is "eleven million, fifty-two thousand, one hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •