Base | Representation |
---|---|
bin | 1010000001100001100110… |
… | …1000100000101000110101 |
3 | 1110000121221110201100101212 |
4 | 2200120121220200220311 |
5 | 2421033123412201011 |
6 | 35235042302131205 |
7 | 2215156326255053 |
oct | 240303150405065 |
9 | 43017843640355 |
10 | 11021316131381 |
11 | 356a1286a3a16 |
12 | 12a0008580b05 |
13 | 61c3c869424a |
14 | 2a161257b1d3 |
15 | 141a52c5008b |
hex | a0619a20a35 |
11021316131381 has 2 divisors, whose sum is σ = 11021316131382. Its totient is φ = 11021316131380.
The previous prime is 11021316131341. The next prime is 11021316131437. The reversal of 11021316131381 is 18313161312011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10303881721156 + 717434410225 = 3209966^2 + 847015^2 .
It is a cyclic number.
It is not a de Polignac number, because 11021316131381 - 218 = 11021315869237 is a prime.
It is a super-2 number, since 2×110213161313812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11021316131341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510658065690 + 5510658065691.
It is an arithmetic number, because the mean of its divisors is an integer number (5510658065691).
Almost surely, 211021316131381 is an apocalyptic number.
It is an amenable number.
11021316131381 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021316131381 is an equidigital number, since it uses as much as digits as its factorization.
11021316131381 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 32.
Adding to 11021316131381 its reverse (18313161312011), we get a palindrome (29334477443392).
The spelling of 11021316131381 in words is "eleven trillion, twenty-one billion, three hundred sixteen million, one hundred thirty-one thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •