Base | Representation |
---|---|
bin | 1010000001101000010011… |
… | …0010111010010101111101 |
3 | 1110000210120202202120020102 |
4 | 2200122010302322111331 |
5 | 2421100314142121341 |
6 | 35235540525130445 |
7 | 2215252020130352 |
oct | 240320462722575 |
9 | 43023522676212 |
10 | 11023114020221 |
11 | 356a970546466 |
12 | 12a042a6b9a25 |
13 | 61c623cc53b4 |
14 | 2a1743264629 |
15 | 141b0a9dcc9b |
hex | a0684cba57d |
11023114020221 has 2 divisors, whose sum is σ = 11023114020222. Its totient is φ = 11023114020220.
The previous prime is 11023114020133. The next prime is 11023114020227. The reversal of 11023114020221 is 12202041132011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11021902005625 + 1212014596 = 3319925^2 + 34814^2 .
It is a cyclic number.
It is not a de Polignac number, because 11023114020221 - 218 = 11023113758077 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11023114020193 and 11023114020202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11023114020227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5511557010110 + 5511557010111.
It is an arithmetic number, because the mean of its divisors is an integer number (5511557010111).
Almost surely, 211023114020221 is an apocalyptic number.
It is an amenable number.
11023114020221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11023114020221 is an equidigital number, since it uses as much as digits as its factorization.
11023114020221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 11023114020221 its reverse (12202041132011), we get a palindrome (23225155152232).
The spelling of 11023114020221 in words is "eleven trillion, twenty-three billion, one hundred fourteen million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •