Base | Representation |
---|---|
bin | 1010000111010001101011… |
… | …1011000001110111000001 |
3 | 1110101001222102102002112111 |
4 | 2201310122323001313001 |
5 | 2424143002213323243 |
6 | 35352302531055321 |
7 | 2225254663344205 |
oct | 241643273016701 |
9 | 43331872362474 |
10 | 11120122011073 |
11 | 35a8020a79829 |
12 | 12b71a2441541 |
13 | 62881398a80a |
14 | 2a6306b9cb05 |
15 | 1443d721139d |
hex | a1d1aec1dc1 |
11120122011073 has 2 divisors, whose sum is σ = 11120122011074. Its totient is φ = 11120122011072.
The previous prime is 11120122011059. The next prime is 11120122011109. The reversal of 11120122011073 is 37011022102111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11012920119184 + 107201891889 = 3318572^2 + 327417^2 .
It is a cyclic number.
It is not a de Polignac number, because 11120122011073 - 221 = 11120119913921 is a prime.
It is a super-3 number, since 3×111201220110733 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (11120122111073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560061005536 + 5560061005537.
It is an arithmetic number, because the mean of its divisors is an integer number (5560061005537).
Almost surely, 211120122011073 is an apocalyptic number.
It is an amenable number.
11120122011073 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120122011073 is an equidigital number, since it uses as much as digits as its factorization.
11120122011073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 22.
Adding to 11120122011073 its reverse (37011022102111), we get a palindrome (48131144113184).
The spelling of 11120122011073 in words is "eleven trillion, one hundred twenty billion, one hundred twenty-two million, eleven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.722 sec. • engine limits •