Base | Representation |
---|---|
bin | 1010000110001011010001… |
… | …0101110010000111111001 |
3 | 1110022021012012000102200211 |
4 | 2201202310111302013321 |
5 | 2423340300100231243 |
6 | 35335455223031121 |
7 | 2224015415306224 |
oct | 241426425620771 |
9 | 43267165012624 |
10 | 11101221102073 |
11 | 35a00019a4083 |
12 | 12b35a859b4a1 |
13 | 626ac0c05bab |
14 | 2a543285a5bb |
15 | 143b7cbebd9d |
hex | a18b45721f9 |
11101221102073 has 2 divisors, whose sum is σ = 11101221102074. Its totient is φ = 11101221102072.
The previous prime is 11101221102071. The next prime is 11101221102107. The reversal of 11101221102073 is 37020112210111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6985406712064 + 4115814390009 = 2642992^2 + 2028747^2 .
It is a cyclic number.
It is not a de Polignac number, because 11101221102073 - 21 = 11101221102071 is a prime.
It is a super-2 number, since 2×111012211020732 (a number of 27 digits) contains 22 as substring.
Together with 11101221102071, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (11101221102071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550610551036 + 5550610551037.
It is an arithmetic number, because the mean of its divisors is an integer number (5550610551037).
Almost surely, 211101221102073 is an apocalyptic number.
It is an amenable number.
11101221102073 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101221102073 is an equidigital number, since it uses as much as digits as its factorization.
11101221102073 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 11101221102073 its reverse (37020112210111), we get a palindrome (48121333312184).
The spelling of 11101221102073 in words is "eleven trillion, one hundred one billion, two hundred twenty-one million, one hundred two thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •