Base | Representation |
---|---|
bin | 101011000111… |
… | …010101001101 |
3 | 210021012201210 |
4 | 223013111031 |
5 | 10343132341 |
6 | 1042125033 |
7 | 165032040 |
oct | 53072515 |
9 | 23235653 |
10 | 11302221 |
11 | 641a587 |
12 | 3950779 |
13 | 2459508 |
14 | 1702c57 |
15 | ed3c16 |
hex | ac754d |
11302221 has 8 divisors (see below), whose sum is σ = 17222464. Its totient is φ = 6458400.
The previous prime is 11302219. The next prime is 11302237. The reversal of 11302221 is 12220311.
11302221 is digitally balanced in base 3, because in such base 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 not a de Polignac number, because 11302221 - 21 = 11302219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11302197 and 11302206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11302211) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 269080 + ... + 269121.
It is an arithmetic number, because the mean of its divisors is an integer number (2152808).
Almost surely, 211302221 is an apocalyptic number.
It is an amenable number.
11302221 is a deficient number, since it is larger than the sum of its proper divisors (5920243).
11302221 is an equidigital number, since it uses as much as digits as its factorization.
11302221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 538211.
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 11302221 is about 3361.8776003894. The cubic root of 11302221 is about 224.4164036483.
Adding to 11302221 its reverse (12220311), we get a palindrome (23522532).
The spelling of 11302221 in words is "eleven million, three hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.184 sec. • engine limits •