Base | Representation |
---|---|
bin | 1010001001000011000000… |
… | …1101111010010000100001 |
3 | 1110110222111120211221222111 |
4 | 2202100300031322100201 |
5 | 2430142303234201111 |
6 | 35414253401035321 |
7 | 2230412606420623 |
oct | 242206015722041 |
9 | 43428446757874 |
10 | 11150544053281 |
11 | 3609a12473376 |
12 | 1301072785b41 |
13 | 62b651611019 |
14 | 2a79912a8c13 |
15 | 1450b7e04a21 |
hex | a243037a421 |
11150544053281 has 2 divisors, whose sum is σ = 11150544053282. Its totient is φ = 11150544053280.
The previous prime is 11150544053273. The next prime is 11150544053381. The reversal of 11150544053281 is 18235044505111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6761586093025 + 4388957960256 = 2600305^2 + 2094984^2 .
It is a cyclic number.
It is not a de Polignac number, because 11150544053281 - 23 = 11150544053273 is a prime.
It is a super-2 number, since 2×111505440532812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11150544053261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5575272026640 + 5575272026641.
It is an arithmetic number, because the mean of its divisors is an integer number (5575272026641).
Almost surely, 211150544053281 is an apocalyptic number.
It is an amenable number.
11150544053281 is a deficient number, since it is larger than the sum of its proper divisors (1).
11150544053281 is an equidigital number, since it uses as much as digits as its factorization.
11150544053281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96000, while the sum is 40.
Adding to 11150544053281 its reverse (18235044505111), we get a palindrome (29385588558392).
The spelling of 11150544053281 in words is "eleven trillion, one hundred fifty billion, five hundred forty-four million, fifty-three thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •