Base | Representation |
---|---|
bin | 1010001101000110111101… |
… | …0000010010111110000101 |
3 | 1110201122121110201020001211 |
4 | 2203101233100102332011 |
5 | 2432313204201321013 |
6 | 35510313325451421 |
7 | 2235433005616456 |
oct | 243215720227605 |
9 | 43648543636054 |
10 | 11220321120133 |
11 | 3636569839474 |
12 | 13126a6a10b71 |
13 | 6350c1801b68 |
14 | 2ab0d044d12d |
15 | 146cedb7b23d |
hex | a346f412f85 |
11220321120133 has 2 divisors, whose sum is σ = 11220321120134. Its totient is φ = 11220321120132.
The previous prime is 11220321120121. The next prime is 11220321120137. The reversal of 11220321120133 is 33102112302211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10867980342244 + 352340777889 = 3296662^2 + 593583^2 .
It is an emirp because it is prime and its reverse (33102112302211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11220321120133 - 225 = 11220287565701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11220321120137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5610160560066 + 5610160560067.
It is an arithmetic number, because the mean of its divisors is an integer number (5610160560067).
Almost surely, 211220321120133 is an apocalyptic number.
It is an amenable number.
11220321120133 is a deficient number, since it is larger than the sum of its proper divisors (1).
11220321120133 is an equidigital number, since it uses as much as digits as its factorization.
11220321120133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11220321120133 its reverse (33102112302211), we get a palindrome (44322433422344).
The spelling of 11220321120133 in words is "eleven trillion, two hundred twenty billion, three hundred twenty-one million, one hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •