Base | Representation |
---|---|
bin | 1010000000111011111111… |
… | …1110011101010110001001 |
3 | 1102222122212222211101201022 |
4 | 2200032333332131112021 |
5 | 2420401440313013113 |
6 | 35230252514002225 |
7 | 2214351226465442 |
oct | 240167776352611 |
9 | 42878788741638 |
10 | 11011222001033 |
11 | 3565918837431 |
12 | 129a06bb76375 |
13 | 61b47a339b57 |
14 | 2a0d35b142c9 |
15 | 14166199b908 |
hex | a03bff9d589 |
11011222001033 has 2 divisors, whose sum is σ = 11011222001034. Its totient is φ = 11011222001032.
The previous prime is 11011222000981. The next prime is 11011222001119. The reversal of 11011222001033 is 33010022211011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7900326805504 + 3110895195529 = 2810752^2 + 1763773^2 .
It is a cyclic number.
It is not a de Polignac number, because 11011222001033 - 28 = 11011222000777 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11011222001933) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505611000516 + 5505611000517.
It is an arithmetic number, because the mean of its divisors is an integer number (5505611000517).
Almost surely, 211011222001033 is an apocalyptic number.
It is an amenable number.
11011222001033 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011222001033 is an equidigital number, since it uses as much as digits as its factorization.
11011222001033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11011222001033 its reverse (33010022211011), we get a palindrome (44021244212044).
The spelling of 11011222001033 in words is "eleven trillion, eleven billion, two hundred twenty-two million, one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •