Base | Representation |
---|---|
bin | 101010011110… |
… | …000010101111 |
3 | 202221121202011 |
4 | 222132002233 |
5 | 10322224403 |
6 | 1034342051 |
7 | 163426012 |
oct | 52360257 |
9 | 22847664 |
10 | 11133103 |
11 | 6314513 |
12 | 388a927 |
13 | 23ca547 |
14 | 169b379 |
15 | e9da6d |
hex | a9e0af |
11133103 has 4 divisors (see below), whose sum is σ = 11174760. Its totient is φ = 11091448.
The previous prime is 11133077. The next prime is 11133119. The reversal of 11133103 is 30133111.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 30133111 = 269 ⋅112019.
It is a cyclic number.
It is not a de Polignac number, because 11133103 - 221 = 9035951 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 (11133193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20425 + ... + 20962.
It is an arithmetic number, because the mean of its divisors is an integer number (2793690).
Almost surely, 211133103 is an apocalyptic number.
11133103 is a deficient number, since it is larger than the sum of its proper divisors (41657).
11133103 is an equidigital number, since it uses as much as digits as its factorization.
11133103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41656.
The product of its (nonzero) digits is 27, while the sum is 13.
The square root of 11133103 is about 3336.6304859843. The cubic root of 11133103 is about 223.2914406213.
Adding to 11133103 its reverse (30133111), we get a palindrome (41266214).
It can be divided in two parts, 11133 and 103, that added together give a square (11236 = 1062).
The spelling of 11133103 in words is "eleven million, one hundred thirty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •