Base | Representation |
---|---|
bin | 1010000000010011101011… |
… | …1101000111010010011101 |
3 | 1102221121221210222021100011 |
4 | 2200010322331013102131 |
5 | 2420212304442003341 |
6 | 35221303020203221 |
7 | 2213516114100541 |
oct | 240047275072235 |
9 | 42847853867304 |
10 | 11000400344221 |
11 | 356127523a502 |
12 | 1297b4b999511 |
13 | 61a444356222 |
14 | 2a05ca7c9a21 |
15 | 14122b8d9b81 |
hex | a013af4749d |
11000400344221 has 2 divisors, whose sum is σ = 11000400344222. Its totient is φ = 11000400344220.
The previous prime is 11000400344209. The next prime is 11000400344239. The reversal of 11000400344221 is 12244300400011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10603235700121 + 397164644100 = 3256261^2 + 630210^2 .
It is a cyclic number.
It is not a de Polignac number, because 11000400344221 - 223 = 11000391955613 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11000400344192 and 11000400344201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11000400342221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500200172110 + 5500200172111.
It is an arithmetic number, because the mean of its divisors is an integer number (5500200172111).
Almost surely, 211000400344221 is an apocalyptic number.
It is an amenable number.
11000400344221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000400344221 is an equidigital number, since it uses as much as digits as its factorization.
11000400344221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 11000400344221 its reverse (12244300400011), we get a palindrome (23244700744232).
The spelling of 11000400344221 in words is "eleven trillion, four hundred million, three hundred forty-four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •