Base | Representation |
---|---|
bin | 1010001001011010100001… |
… | …0110100000101101010101 |
3 | 1110111120210101010221221002 |
4 | 2202112220112200231111 |
5 | 2430243214230304031 |
6 | 35421215504433045 |
7 | 2231025153606461 |
oct | 242265026405525 |
9 | 43446711127832 |
10 | 11156854541141 |
11 | 36116605912a1 |
12 | 1302334018785 |
13 | 62c118b0a4ca |
14 | 2a7dcd41b4a1 |
15 | 145336e1dccb |
hex | a25a85a0b55 |
11156854541141 has 2 divisors, whose sum is σ = 11156854541142. Its totient is φ = 11156854541140.
The previous prime is 11156854541137. The next prime is 11156854541159. The reversal of 11156854541141 is 14114545865111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8905867432900 + 2250987108241 = 2984270^2 + 1500329^2 .
It is a cyclic number.
It is not a de Polignac number, because 11156854541141 - 22 = 11156854541137 is a prime.
It is a super-3 number, since 3×111568545411413 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11156854541341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5578427270570 + 5578427270571.
It is an arithmetic number, because the mean of its divisors is an integer number (5578427270571).
Almost surely, 211156854541141 is an apocalyptic number.
It is an amenable number.
11156854541141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11156854541141 is an equidigital number, since it uses as much as digits as its factorization.
11156854541141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 384000, while the sum is 47.
The spelling of 11156854541141 in words is "eleven trillion, one hundred fifty-six billion, eight hundred fifty-four million, five hundred forty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •