Base | Representation |
---|---|
bin | 1010000111010010011010… |
… | …1111000111000000101001 |
3 | 1110101002111020100210111211 |
4 | 2201310212233013000221 |
5 | 2424143403433304113 |
6 | 35352334331153121 |
7 | 2225262621132403 |
oct | 241644657070051 |
9 | 43332436323454 |
10 | 11120320213033 |
11 | 35a81129438a9 |
12 | 12b72388a57a1 |
13 | 628845a65595 |
14 | 2a6325233b73 |
15 | 1443e9812b3d |
hex | a1d26bc7029 |
11120320213033 has 2 divisors, whose sum is σ = 11120320213034. Its totient is φ = 11120320213032.
The previous prime is 11120320212983. The next prime is 11120320213061. The reversal of 11120320213033 is 33031202302111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10153348890624 + 966971322409 = 3186432^2 + 983347^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11120320213033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11120320212995 and 11120320213013.
It is not a weakly prime, because it can be changed into another prime (11120320213073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560160106516 + 5560160106517.
It is an arithmetic number, because the mean of its divisors is an integer number (5560160106517).
Almost surely, 211120320213033 is an apocalyptic number.
It is an amenable number.
11120320213033 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120320213033 is an equidigital number, since it uses as much as digits as its factorization.
11120320213033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 11120320213033 its reverse (33031202302111), we get a palindrome (44151522515144).
The spelling of 11120320213033 in words is "eleven trillion, one hundred twenty billion, three hundred twenty million, two hundred thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •