Base | Representation |
---|---|
bin | 1010000000111011010000… |
… | …0000000101010010111101 |
3 | 1102222122100222210120121111 |
4 | 2200032310000011102331 |
5 | 2420401032400201341 |
6 | 35230220540002021 |
7 | 2214343240040002 |
oct | 240166400052275 |
9 | 42878328716544 |
10 | 11011021100221 |
11 | 35658253996aa |
12 | 129a014830311 |
13 | 61b44782882c |
14 | 2a0d171798a9 |
15 | 14164e015681 |
hex | a03b40054bd |
11011021100221 has 2 divisors, whose sum is σ = 11011021100222. Its totient is φ = 11011021100220.
The previous prime is 11011021100089. The next prime is 11011021100239. The reversal of 11011021100221 is 12200112011011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6788760525625 + 4222260574596 = 2605525^2 + 2054814^2 .
It is a cyclic number.
It is not a de Polignac number, because 11011021100221 - 223 = 11011012711613 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011021100281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505510550110 + 5505510550111.
It is an arithmetic number, because the mean of its divisors is an integer number (5505510550111).
Almost surely, 211011021100221 is an apocalyptic number.
It is an amenable number.
11011021100221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011021100221 is an equidigital number, since it uses as much as digits as its factorization.
11011021100221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11011021100221 its reverse (12200112011011), we get a palindrome (23211133111232).
The spelling of 11011021100221 in words is "eleven trillion, eleven billion, twenty-one million, one hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •