Base | Representation |
---|---|
bin | 1010001000011111110110… |
… | …0000000010010001111001 |
3 | 1110110002010122021120000112 |
4 | 2202013331200002101321 |
5 | 2430013434411411441 |
6 | 35410052511314105 |
7 | 2226626631646652 |
oct | 242077540022171 |
9 | 43402118246015 |
10 | 11141103232121 |
11 | 3605a08365735 |
12 | 12bb278b1b935 |
13 | 62a7a8728c05 |
14 | 2a7337504529 |
15 | 144c1419e4eb |
hex | a21fd802479 |
11141103232121 has 2 divisors, whose sum is σ = 11141103232122. Its totient is φ = 11141103232120.
The previous prime is 11141103232117. The next prime is 11141103232153. The reversal of 11141103232121 is 12123230114111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10976393068096 + 164710164025 = 3313064^2 + 405845^2 .
It is a cyclic number.
It is not a de Polignac number, because 11141103232121 - 22 = 11141103232117 is a prime.
It is not a weakly prime, because it can be changed into another prime (11141103235121) 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, 5570551616060 + 5570551616061.
It is an arithmetic number, because the mean of its divisors is an integer number (5570551616061).
Almost surely, 211141103232121 is an apocalyptic number.
It is an amenable number.
11141103232121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11141103232121 is an equidigital number, since it uses as much as digits as its factorization.
11141103232121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 11141103232121 its reverse (12123230114111), we get a palindrome (23264333346232).
The spelling of 11141103232121 in words is "eleven trillion, one hundred forty-one billion, one hundred three million, two hundred thirty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •