Base | Representation |
---|---|
bin | 1010001100100100010011… |
… | …0111011011000101100001 |
3 | 1110200202121021001111012222 |
4 | 2203021010313123011201 |
5 | 2432140132111201423 |
6 | 35502134351000425 |
7 | 2234653345603562 |
oct | 243110467330541 |
9 | 43622537044188 |
10 | 11211020022113 |
11 | 36326265938aa |
12 | 131092bb09115 |
13 | 63426b85b072 |
14 | 2aa88b05a169 |
15 | 1469573253c8 |
hex | a3244ddb161 |
11211020022113 has 2 divisors, whose sum is σ = 11211020022114. Its totient is φ = 11211020022112.
The previous prime is 11211020022089. The next prime is 11211020022133. The reversal of 11211020022113 is 31122002011211.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10650869563489 + 560150458624 = 3263567^2 + 748432^2 .
It is a cyclic number.
It is not a de Polignac number, because 11211020022113 - 218 = 11211019759969 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11211020022091 and 11211020022100.
It is not a weakly prime, because it can be changed into another prime (11211020022133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5605510011056 + 5605510011057.
It is an arithmetic number, because the mean of its divisors is an integer number (5605510011057).
Almost surely, 211211020022113 is an apocalyptic number.
It is an amenable number.
11211020022113 is a deficient number, since it is larger than the sum of its proper divisors (1).
11211020022113 is an equidigital number, since it uses as much as digits as its factorization.
11211020022113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 11211020022113 its reverse (31122002011211), we get a palindrome (42333022033324).
The spelling of 11211020022113 in words is "eleven trillion, two hundred eleven billion, twenty million, twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •