Base | Representation |
---|---|
bin | 101010000101… |
… | …001000111111 |
3 | 202202102211101 |
4 | 222011020333 |
5 | 10310443403 |
6 | 1032233531 |
7 | 162522436 |
oct | 52051077 |
9 | 22672741 |
10 | 11031103 |
11 | 6254916 |
12 | 383b8a7 |
13 | 2392ca5 |
14 | 167211d |
15 | e7d71d |
hex | a8523f |
11031103 has 8 divisors (see below), whose sum is σ = 11274048. Its totient is φ = 10790784.
The previous prime is 11031073. The next prime is 11031121. The reversal of 11031103 is 30113011.
11031103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11031103 - 217 = 10900031 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 11031103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11031193) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9450 + ... + 10552.
It is an arithmetic number, because the mean of its divisors is an integer number (1409256).
Almost surely, 211031103 is an apocalyptic number.
11031103 is a deficient number, since it is larger than the sum of its proper divisors (242945).
11031103 is a wasteful number, since it uses less digits than its factorization.
11031103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1313.
The product of its (nonzero) digits is 9, while the sum is 10.
The square root of 11031103 is about 3321.3104341510. The cubic root of 11031103 is about 222.6074252960.
Adding to 11031103 its reverse (30113011), we get a palindrome (41144114).
It can be divided in two parts, 110 and 31103, that added together give a palindrome (31213).
The spelling of 11031103 in words is "eleven million, thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •