Base | Representation |
---|---|
bin | 1010000111010001111110… |
… | …1000101111001011010001 |
3 | 1110101002011221020022221022 |
4 | 2201310133220233023101 |
5 | 2424143132440231113 |
6 | 35352314434205225 |
7 | 2225256643533122 |
oct | 241643750571321 |
9 | 43332157208838 |
10 | 11120201102033 |
11 | 35a8061689a61 |
12 | 12b7204a23815 |
13 | 6288271901ba |
14 | 2a63134aa049 |
15 | 1443de135908 |
hex | a1d1fa2f2d1 |
11120201102033 has 2 divisors, whose sum is σ = 11120201102034. Its totient is φ = 11120201102032.
The previous prime is 11120201101993. The next prime is 11120201102039. The reversal of 11120201102033 is 33020110202111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6374983666129 + 4745217435904 = 2524873^2 + 2178352^2 .
It is a cyclic number.
It is not a de Polignac number, because 11120201102033 - 232 = 11115906134737 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 (11120201102039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560100551016 + 5560100551017.
It is an arithmetic number, because the mean of its divisors is an integer number (5560100551017).
Almost surely, 211120201102033 is an apocalyptic number.
It is an amenable number.
11120201102033 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120201102033 is an equidigital number, since it uses as much as digits as its factorization.
11120201102033 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 11120201102033 its reverse (33020110202111), we get a palindrome (44140311304144).
The spelling of 11120201102033 in words is "eleven trillion, one hundred twenty billion, two hundred one million, one hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •