Base | Representation |
---|---|
bin | 1010000001100001100110… |
… | …1000100000101000001101 |
3 | 1110000121221110201100100101 |
4 | 2200120121220200220031 |
5 | 2421033123412200331 |
6 | 35235042302131101 |
7 | 2215156326254665 |
oct | 240303150405015 |
9 | 43017843640311 |
10 | 11021316131341 |
11 | 356a1286a398a |
12 | 12a0008580a91 |
13 | 61c3c8694219 |
14 | 2a161257b1a5 |
15 | 141a52c50061 |
hex | a0619a20a0d |
11021316131341 has 2 divisors, whose sum is σ = 11021316131342. Its totient is φ = 11021316131340.
The previous prime is 11021316131333. The next prime is 11021316131381. The reversal of 11021316131341 is 14313161312011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10444595876100 + 576720255241 = 3231810^2 + 759421^2 .
It is an emirp because it is prime and its reverse (14313161312011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11021316131341 - 23 = 11021316131333 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11021316131381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510658065670 + 5510658065671.
It is an arithmetic number, because the mean of its divisors is an integer number (5510658065671).
Almost surely, 211021316131341 is an apocalyptic number.
It is an amenable number.
11021316131341 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021316131341 is an equidigital number, since it uses as much as digits as its factorization.
11021316131341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 28.
Adding to 11021316131341 its reverse (14313161312011), we get a palindrome (25334477443352).
The spelling of 11021316131341 in words is "eleven trillion, twenty-one billion, three hundred sixteen million, one hundred thirty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •