Base | Representation |
---|---|
bin | 10101000101111110… |
… | …01111010001100101 |
3 | 1002020012220012111012 |
4 | 22202333033101211 |
5 | 141143022434341 |
6 | 5111413352005 |
7 | 550425664211 |
oct | 124277172145 |
9 | 32205805435 |
10 | 11324421221 |
11 | 4891382303 |
12 | 2240638605 |
13 | 10b61c6079 |
14 | 795ddd941 |
15 | 4642c40eb |
hex | 2a2fcf465 |
11324421221 has 8 divisors (see below), whose sum is σ = 11434445784. Its totient is φ = 11214568960.
The previous prime is 11324421193. The next prime is 11324421239. The reversal of 11324421221 is 12212442311.
It can be written as a sum of positive squares in 4 ways, for example, as 485320900 + 10839100321 = 22030^2 + 104111^2 .
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 11324421221 - 226 = 11257312357 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11324421281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91025 + ... + 175881.
It is an arithmetic number, because the mean of its divisors is an integer number (1429305723).
Almost surely, 211324421221 is an apocalyptic number.
It is an amenable number.
11324421221 is a deficient number, since it is larger than the sum of its proper divisors (110024563).
11324421221 is a wasteful number, since it uses less digits than its factorization.
11324421221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86151.
The product of its digits is 768, while the sum is 23.
Adding to 11324421221 its reverse (12212442311), we get a palindrome (23536863532).
The spelling of 11324421221 in words is "eleven billion, three hundred twenty-four million, four hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •