Base | Representation |
---|---|
bin | 1010001110011000011101… |
… | …1101011001011011101101 |
3 | 1110210202002101112022222201 |
4 | 2203212013131121123231 |
5 | 2433143012210403031 |
6 | 35524332445541501 |
7 | 2240136150453025 |
oct | 243460735313355 |
9 | 43722071468881 |
10 | 11242202044141 |
11 | 3644877a74542 |
12 | 1316992874891 |
13 | 63719aa91683 |
14 | 2ac1a8474a85 |
15 | 14767ead7d61 |
hex | a39877596ed |
11242202044141 has 2 divisors, whose sum is σ = 11242202044142. Its totient is φ = 11242202044140.
The previous prime is 11242202044111. The next prime is 11242202044147. The reversal of 11242202044141 is 14144020224211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9772157342025 + 1470044702116 = 3126045^2 + 1212454^2 .
It is a cyclic number.
It is not a de Polignac number, because 11242202044141 - 29 = 11242202043629 is a prime.
It is a super-3 number, since 3×112422020441413 (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 (11242202044147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5621101022070 + 5621101022071.
It is an arithmetic number, because the mean of its divisors is an integer number (5621101022071).
Almost surely, 211242202044141 is an apocalyptic number.
It is an amenable number.
11242202044141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11242202044141 is an equidigital number, since it uses as much as digits as its factorization.
11242202044141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4096, while the sum is 28.
Adding to 11242202044141 its reverse (14144020224211), we get a palindrome (25386222268352).
The spelling of 11242202044141 in words is "eleven trillion, two hundred forty-two billion, two hundred two million, forty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •