Base | Representation |
---|---|
bin | 101001111110… |
… | …010011101000 |
3 | 202201000102200 |
4 | 221332103220 |
5 | 10304044422 |
6 | 1031500200 |
7 | 162345021 |
oct | 51762350 |
9 | 22630380 |
10 | 11003112 |
11 | 623588a |
12 | 3827660 |
13 | 2383323 |
14 | 1665c48 |
15 | e752ac |
hex | a7e4e8 |
11003112 has 24 divisors (see below), whose sum is σ = 29800290. Its totient is φ = 3667680.
The previous prime is 11003107. The next prime is 11003137. The reversal of 11003112 is 21130011.
It can be written as a sum of positive squares in only one way, i.e., 9400356 + 1602756 = 3066^2 + 1266^2 .
It is a tau number, because it is divible by the number of its divisors (24).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11003094 and 11003103.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 76339 + ... + 76482.
Almost surely, 211003112 is an apocalyptic number.
11003112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11003112 is an abundant number, since it is smaller than the sum of its proper divisors (18797178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11003112 is a wasteful number, since it uses less digits than its factorization.
11003112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152833 (or 152826 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 11003112 is about 3317.0939088304. The cubic root of 11003112 is about 222.4189798856.
Adding to 11003112 its reverse (21130011), we get a palindrome (32133123).
The spelling of 11003112 in words is "eleven million, three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •