Base | Representation |
---|---|
bin | 101010000101… |
… | …001000111110 |
3 | 202202102211100 |
4 | 222011020332 |
5 | 10310443402 |
6 | 1032233530 |
7 | 162522435 |
oct | 52051076 |
9 | 22672740 |
10 | 11031102 |
11 | 6254915 |
12 | 383b8a6 |
13 | 2392ca4 |
14 | 167211c |
15 | e7d71c |
hex | a8523e |
11031102 has 48 divisors (see below), whose sum is σ = 25204608. Its totient is φ = 3481920.
The previous prime is 11031073. The next prime is 11031121. The reversal of 11031102 is 20113011.
It is a super-2 number, since 2×110311022 = 243370422668808, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 29388 + ... + 29760.
It is an arithmetic number, because the mean of its divisors is an integer number (525096).
Almost surely, 211031102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11031102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12602304).
11031102 is an abundant number, since it is smaller than the sum of its proper divisors (14173506).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11031102 is a wasteful number, since it uses less digits than its factorization.
11031102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 465 (or 462 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 11031102 is about 3321.3102836080. The cubic root of 11031102 is about 222.6074185693.
Adding to 11031102 its reverse (20113011), we get a palindrome (31144113).
The spelling of 11031102 in words is "eleven million, thirty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •