Base | Representation |
---|---|
bin | 101010110011… |
… | …100000001111 |
3 | 210010002022212 |
4 | 222303200033 |
5 | 10333033012 |
6 | 1040301035 |
7 | 164243210 |
oct | 52634017 |
9 | 23102285 |
10 | 11221007 |
11 | 6374566 |
12 | 391177b |
13 | 242b565 |
14 | 16c1407 |
15 | eb9b22 |
hex | ab380f |
11221007 has 8 divisors (see below), whose sum is σ = 12848256. Its totient is φ = 9599832.
The previous prime is 11220997. The next prime is 11221009. The reversal of 11221007 is 70012211.
11221007 is digitally balanced in base 2 and base 8, because in such bases 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 11221007 - 24 = 11220991 is a prime.
It is a Duffinian number.
11221007 is strictly pandigital in base 8.
It is a junction number, because it is equal to n+sod(n) for n = 11220982 and 11221000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11221009) 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, 3608 + ... + 5954.
It is an arithmetic number, because the mean of its divisors is an integer number (1606032).
Almost surely, 211221007 is an apocalyptic number.
11221007 is a deficient number, since it is larger than the sum of its proper divisors (1627249).
11221007 is an equidigital number, since it uses as much as digits as its factorization.
11221007 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3037.
The product of its (nonzero) digits is 28, while the sum is 14.
The square root of 11221007 is about 3349.7771567673. Note that the first 3 decimals coincide. The cubic root of 11221007 is about 223.8775837812.
Adding to 11221007 its reverse (70012211), we get a palindrome (81233218).
The spelling of 11221007 in words is "eleven million, two hundred twenty-one thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •