Base | Representation |
---|---|
bin | 10100011111010110… |
… | …01100100101011101 |
3 | 1001101122012020020102 |
4 | 22033223030211131 |
5 | 140012100301341 |
6 | 5015320430445 |
7 | 536412600446 |
oct | 121753144535 |
9 | 31348166212 |
10 | 11000400221 |
11 | 4735491558 |
12 | 2170018425 |
13 | 1064037875 |
14 | 764d762cd |
15 | 445b1cc9b |
hex | 28facc95d |
11000400221 has 4 divisors (see below), whose sum is σ = 11003088000. Its totient is φ = 10997712444.
The previous prime is 11000400217. The next prime is 11000400247. The reversal of 11000400221 is 12200400011.
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: 12200400011 = 211 ⋅57821801.
It is a cyclic number.
It is not a de Polignac number, because 11000400221 - 22 = 11000400217 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 (11000400211) 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 3 ways as a sum of consecutive naturals, for example, 1337741 + ... + 1345938.
It is an arithmetic number, because the mean of its divisors is an integer number (2750772000).
Almost surely, 211000400221 is an apocalyptic number.
It is an amenable number.
11000400221 is a deficient number, since it is larger than the sum of its proper divisors (2687779).
11000400221 is an equidigital number, since it uses as much as digits as its factorization.
11000400221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2687778.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 11000400221 its reverse (12200400011), we get a palindrome (23200800232).
The spelling of 11000400221 in words is "eleven billion, four hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •