Base | Representation |
---|---|
bin | 1010000111010101101100… |
… | …1011111111110101011101 |
3 | 1110101011202120012211010201 |
4 | 2201311123023333311131 |
5 | 2424202204222413203 |
6 | 35353001524303501 |
7 | 2225323464662215 |
oct | 241653313776535 |
9 | 43334676184121 |
10 | 11121200201053 |
11 | 35a8524647928 |
12 | 12b7443541b91 |
13 | 628956173257 |
14 | 2a63aa061245 |
15 | 14444bbd9e1d |
hex | a1d5b2ffd5d |
11121200201053 has 2 divisors, whose sum is σ = 11121200201054. Its totient is φ = 11121200201052.
The previous prime is 11121200201003. The next prime is 11121200201063. The reversal of 11121200201053 is 35010200212111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11112175581049 + 9024620004 = 3333493^2 + 94998^2 .
It is a cyclic number.
It is not a de Polignac number, because 11121200201053 - 225 = 11121166646621 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11121200201053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11121200201003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560600100526 + 5560600100527.
It is an arithmetic number, because the mean of its divisors is an integer number (5560600100527).
Almost surely, 211121200201053 is an apocalyptic number.
It is an amenable number.
11121200201053 is a deficient number, since it is larger than the sum of its proper divisors (1).
11121200201053 is an equidigital number, since it uses as much as digits as its factorization.
11121200201053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 120, while the sum is 19.
Adding to 11121200201053 its reverse (35010200212111), we get a palindrome (46131400413164).
The spelling of 11121200201053 in words is "eleven trillion, one hundred twenty-one billion, two hundred million, two hundred one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •