Base | Representation |
---|---|
bin | 1010000111100001101100… |
… | …1011001111111010110001 |
3 | 1110101111002001011001112122 |
4 | 2201320123023033322301 |
5 | 2424230303313332012 |
6 | 35354253310204025 |
7 | 2225466346166006 |
oct | 241703313177261 |
9 | 43344061131478 |
10 | 11124421230257 |
11 | 35a9927853835 |
12 | 12b7ba21b3615 |
13 | 62904a5957aa |
14 | 2a65d3b618ad |
15 | 14458988de72 |
hex | a1e1b2cfeb1 |
11124421230257 has 2 divisors, whose sum is σ = 11124421230258. Its totient is φ = 11124421230256.
The previous prime is 11124421230133. The next prime is 11124421230367. The reversal of 11124421230257 is 75203212442111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6886850766961 + 4237570463296 = 2624281^2 + 2058536^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11124421230257 is a prime.
It is a super-3 number, since 3×111244212302573 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (11124421430257) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5562210615128 + 5562210615129.
It is an arithmetic number, because the mean of its divisors is an integer number (5562210615129).
Almost surely, 211124421230257 is an apocalyptic number.
It is an amenable number.
11124421230257 is a deficient number, since it is larger than the sum of its proper divisors (1).
11124421230257 is an equidigital number, since it uses as much as digits as its factorization.
11124421230257 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 26880, while the sum is 35.
Adding to 11124421230257 its reverse (75203212442111), we get a palindrome (86327633672368).
The spelling of 11124421230257 in words is "eleven trillion, one hundred twenty-four billion, four hundred twenty-one million, two hundred thirty thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •