Base | Representation |
---|---|
bin | 1010000110111111001000… |
… | …0011001101001011110101 |
3 | 1110100121010022100211211212 |
4 | 2201233302003031023311 |
5 | 2424102302134241321 |
6 | 35350120405411205 |
7 | 2225020364234222 |
oct | 241576203151365 |
9 | 43317108324755 |
10 | 11115141321461 |
11 | 35a59a5560a21 |
12 | 12b6232409b05 |
13 | 6281cbb304b8 |
14 | 2a5d934c6949 |
15 | 1441e4d2155b |
hex | a1bf20cd2f5 |
11115141321461 has 2 divisors, whose sum is σ = 11115141321462. Its totient is φ = 11115141321460.
The previous prime is 11115141321457. The next prime is 11115141321587. The reversal of 11115141321461 is 16412314151111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9815782990225 + 1299358331236 = 3133015^2 + 1139894^2 .
It is a cyclic number.
It is not a de Polignac number, because 11115141321461 - 22 = 11115141321457 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11115141321161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5557570660730 + 5557570660731.
It is an arithmetic number, because the mean of its divisors is an integer number (5557570660731).
Almost surely, 211115141321461 is an apocalyptic number.
It is an amenable number.
11115141321461 is a deficient number, since it is larger than the sum of its proper divisors (1).
11115141321461 is an equidigital number, since it uses as much as digits as its factorization.
11115141321461 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2880, while the sum is 32.
Adding to 11115141321461 its reverse (16412314151111), we get a palindrome (27527455472572).
The spelling of 11115141321461 in words is "eleven trillion, one hundred fifteen billion, one hundred forty-one million, three hundred twenty-one thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •