Base | Representation |
---|---|
bin | 1010000111011001001000… |
… | …0001100110000110010001 |
3 | 1110101021010200101200100021 |
4 | 2201312102001212012101 |
5 | 2424211100234033243 |
6 | 35353233111423441 |
7 | 2225355336012301 |
oct | 241662201460621 |
9 | 43337120350307 |
10 | 11122120221073 |
11 | 35a8956a03554 |
12 | 12b765b684b81 |
13 | 628a719591b4 |
14 | 2a645630d601 |
15 | 1444a286d6ed |
hex | a1d92066191 |
11122120221073 has 2 divisors, whose sum is σ = 11122120221074. Its totient is φ = 11122120221072.
The previous prime is 11122120221053. The next prime is 11122120221137. The reversal of 11122120221073 is 37012202122111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5854328663184 + 5267791557889 = 2419572^2 + 2295167^2 .
It is a cyclic number.
It is not a de Polignac number, because 11122120221073 - 25 = 11122120221041 is a prime.
It is not a weakly prime, because it can be changed into another prime (11122120221053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5561060110536 + 5561060110537.
It is an arithmetic number, because the mean of its divisors is an integer number (5561060110537).
Almost surely, 211122120221073 is an apocalyptic number.
It is an amenable number.
11122120221073 is a deficient number, since it is larger than the sum of its proper divisors (1).
11122120221073 is an equidigital number, since it uses as much as digits as its factorization.
11122120221073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 25.
Adding to 11122120221073 its reverse (37012202122111), we get a palindrome (48134322343184).
The spelling of 11122120221073 in words is "eleven trillion, one hundred twenty-two billion, one hundred twenty million, two hundred twenty-one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •