Base | Representation |
---|---|
bin | 101010110011… |
… | …100000010101 |
3 | 210010002100002 |
4 | 222303200111 |
5 | 10333033023 |
6 | 1040301045 |
7 | 164243216 |
oct | 52634025 |
9 | 23102302 |
10 | 11221013 |
11 | 6374571 |
12 | 3911785 |
13 | 242b56b |
14 | 16c140d |
15 | eb9b28 |
hex | ab3815 |
11221013 has 8 divisors (see below), whose sum is σ = 11400000. Its totient is φ = 11043648.
The previous prime is 11221009. The next prime is 11221043. The reversal of 11221013 is 31012211.
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 11221013 - 22 = 11221009 is a prime.
It is a super-2 number, since 2×112210132 = 251822265492338, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11220985 and 11221003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11221043) 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 7 ways as a sum of consecutive naturals, for example, 22238 + ... + 22736.
It is an arithmetic number, because the mean of its divisors is an integer number (1425000).
Almost surely, 211221013 is an apocalyptic number.
It is an amenable number.
11221013 is a deficient number, since it is larger than the sum of its proper divisors (178987).
11221013 is a wasteful number, since it uses less digits than its factorization.
11221013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 811.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 11221013 is about 3349.7780523491. The cubic root of 11221013 is about 223.8776236845.
Adding to 11221013 its reverse (31012211), we get a palindrome (42233224).
The spelling of 11221013 in words is "eleven million, two hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •