Base | Representation |
---|---|
bin | 1010000110110111001110… |
… | …0111011011010011000101 |
3 | 1110100101122110221010210012 |
4 | 2201231303213123103011 |
5 | 2424033431122010041 |
6 | 35345130112440005 |
7 | 2224613666234264 |
oct | 241556347332305 |
9 | 43311573833705 |
10 | 11113020110021 |
11 | 35a5007155415 |
12 | 12b593bb49005 |
13 | 627c515269bb |
14 | 2a5c318b85db |
15 | 14411d9b93eb |
hex | a1b739db4c5 |
11113020110021 has 2 divisors, whose sum is σ = 11113020110022. Its totient is φ = 11113020110020.
The previous prime is 11113020109969. The next prime is 11113020110047. The reversal of 11113020110021 is 12001102031111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11080336893796 + 32683216225 = 3328714^2 + 180785^2 .
It is a cyclic number.
It is not a de Polignac number, because 11113020110021 - 26 = 11113020109957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11113020109978 and 11113020110005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11113020130021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556510055010 + 5556510055011.
It is an arithmetic number, because the mean of its divisors is an integer number (5556510055011).
Almost surely, 211113020110021 is an apocalyptic number.
It is an amenable number.
11113020110021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11113020110021 is an equidigital number, since it uses as much as digits as its factorization.
11113020110021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 11113020110021 its reverse (12001102031111), we get a palindrome (23114122141132).
The spelling of 11113020110021 in words is "eleven trillion, one hundred thirteen billion, twenty million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •