Base | Representation |
---|---|
bin | 1010000110110000100001… |
… | …1000011010011010101101 |
3 | 1110100020000002121111110101 |
4 | 2201230020120122122231 |
5 | 2424021240034342031 |
6 | 35344231403511101 |
7 | 2224521262165045 |
oct | 241541030323255 |
9 | 43306002544411 |
10 | 11111221012141 |
11 | 35a4273657568 |
12 | 12b5519528491 |
13 | 627a25891443 |
14 | 2a5b00998725 |
15 | 144065a8d361 |
hex | a1b0861a6ad |
11111221012141 has 2 divisors, whose sum is σ = 11111221012142. Its totient is φ = 11111221012140.
The previous prime is 11111221012127. The next prime is 11111221012201. The reversal of 11111221012141 is 14121012211111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11061085324041 + 50135688100 = 3325821^2 + 223910^2 .
It is a cyclic number.
It is not a de Polignac number, because 11111221012141 - 25 = 11111221012109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11111221012121) 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, 5555610506070 + 5555610506071.
It is an arithmetic number, because the mean of its divisors is an integer number (5555610506071).
Almost surely, 211111221012141 is an apocalyptic number.
It is an amenable number.
11111221012141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111221012141 is an equidigital number, since it uses as much as digits as its factorization.
11111221012141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 19.
Adding to 11111221012141 its reverse (14121012211111), we get a palindrome (25232233223252).
The spelling of 11111221012141 in words is "eleven trillion, one hundred eleven billion, two hundred twenty-one million, twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •