Base | Representation |
---|---|
bin | 101011001101… |
… | …011000101101 |
3 | 210022110202022 |
4 | 223031120231 |
5 | 10344431041 |
6 | 1042435525 |
7 | 165164246 |
oct | 53153055 |
9 | 23273668 |
10 | 11327021 |
11 | 6437182 |
12 | 3962ba5 |
13 | 24678a4 |
14 | 170bccd |
15 | edb24b |
hex | acd62d |
11327021 has 4 divisors (see below), whose sum is σ = 11923200. Its totient is φ = 10730844.
The previous prime is 11327011. The next prime is 11327039. The reversal of 11327021 is 12072311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 12072311 = 317 ⋅38083.
It is a cyclic number.
It is not a de Polignac number, because 11327021 - 26 = 11326957 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11327011) 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 3 ways as a sum of consecutive naturals, for example, 298061 + ... + 298098.
It is an arithmetic number, because the mean of its divisors is an integer number (2980800).
Almost surely, 211327021 is an apocalyptic number.
It is an amenable number.
11327021 is a deficient number, since it is larger than the sum of its proper divisors (596179).
11327021 is an equidigital number, since it uses as much as digits as its factorization.
11327021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 596178.
The product of its (nonzero) digits is 84, while the sum is 17.
The square root of 11327021 is about 3365.5639943403. The cubic root of 11327021 is about 224.5804263075.
Adding to 11327021 its reverse (12072311), we get a palindrome (23399332).
The spelling of 11327021 in words is "eleven million, three hundred twenty-seven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •