Base | Representation |
---|---|
bin | 10100100100011110… |
… | …01111100110111101 |
3 | 1001111122010001122011 |
4 | 22102033033212331 |
5 | 140104102413341 |
6 | 5023454251221 |
7 | 540444246523 |
oct | 122217174675 |
9 | 31448101564 |
10 | 11043404221 |
11 | 4757794053 |
12 | 21824b6b11 |
13 | 106cc13815 |
14 | 76a96c313 |
15 | 4497b4b81 |
hex | 2923cf9bd |
11043404221 has 4 divisors (see below), whose sum is σ = 11693016252. Its totient is φ = 10393792192.
The previous prime is 11043404213. The next prime is 11043404231. The reversal of 11043404221 is 12240434011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8838632196 + 2204772025 = 94014^2 + 46955^2 .
It is a cyclic number.
It is not a de Polignac number, because 11043404221 - 23 = 11043404213 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11043404192 and 11043404201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11043404231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 324805990 + ... + 324806023.
It is an arithmetic number, because the mean of its divisors is an integer number (2923254063).
Almost surely, 211043404221 is an apocalyptic number.
It is an amenable number.
11043404221 is a deficient number, since it is larger than the sum of its proper divisors (649612031).
11043404221 is an equidigital number, since it uses as much as digits as its factorization.
11043404221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 649612030.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 11043404221 its reverse (12240434011), we get a palindrome (23283838232).
The spelling of 11043404221 in words is "eleven billion, forty-three million, four hundred four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •