Base | Representation |
---|---|
bin | 101010011100… |
… | …001001010011 |
3 | 202221020002022 |
4 | 222130021103 |
5 | 10322002311 |
6 | 1034242055 |
7 | 163364240 |
oct | 52341123 |
9 | 22836068 |
10 | 11125331 |
11 | 6309698 |
12 | 388632b |
13 | 23c6b49 |
14 | 16985c7 |
15 | e9b5db |
hex | a9c253 |
11125331 has 4 divisors (see below), whose sum is σ = 12714672. Its totient is φ = 9535992.
The previous prime is 11125319. The next prime is 11125343. The reversal of 11125331 is 13352111.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (11125319) and next prime (11125343).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11125331 is a prime.
It is a super-2 number, since 2×111253312 = 247545979719122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11125351) 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, 794660 + ... + 794673.
It is an arithmetic number, because the mean of its divisors is an integer number (3178668).
Almost surely, 211125331 is an apocalyptic number.
11125331 is a deficient number, since it is larger than the sum of its proper divisors (1589341).
11125331 is an equidigital number, since it uses as much as digits as its factorization.
11125331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1589340.
The product of its digits is 90, while the sum is 17.
The square root of 11125331 is about 3335.4656346603. The cubic root of 11125331 is about 223.2394687357.
Adding to 11125331 its reverse (13352111), we get a palindrome (24477442).
The spelling of 11125331 in words is "eleven million, one hundred twenty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •