Base | Representation |
---|---|
bin | 1010001100001010010100… |
… | …0100001011111100111101 |
3 | 1110200002121002112012012112 |
4 | 2203002211010023330331 |
5 | 2432031340233434031 |
6 | 35455022231343405 |
7 | 2234315441023322 |
oct | 243024504137475 |
9 | 43602532465175 |
10 | 11204044046141 |
11 | 362a676858901 |
12 | 130b503821b65 |
13 | 6336c951702b |
14 | 2aa3c8794b49 |
15 | 146699ba462b |
hex | a30a510bf3d |
11204044046141 has 2 divisors, whose sum is σ = 11204044046142. Its totient is φ = 11204044046140.
The previous prime is 11204044046137. The next prime is 11204044046161. The reversal of 11204044046141 is 14164044040211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8498828325625 + 2705215720516 = 2915275^2 + 1644754^2 .
It is a cyclic number.
It is not a de Polignac number, because 11204044046141 - 22 = 11204044046137 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11204044046098 and 11204044046107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11204044046161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5602022023070 + 5602022023071.
It is an arithmetic number, because the mean of its divisors is an integer number (5602022023071).
Almost surely, 211204044046141 is an apocalyptic number.
It is an amenable number.
11204044046141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11204044046141 is an equidigital number, since it uses as much as digits as its factorization.
11204044046141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12288, while the sum is 32.
Adding to 11204044046141 its reverse (14164044040211), we get a palindrome (25368088086352).
The spelling of 11204044046141 in words is "eleven trillion, two hundred four billion, forty-four million, forty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •