Base | Representation |
---|---|
bin | 1010000111011101111100… |
… | …0011000001100100100001 |
3 | 1110101101110201221021100112 |
4 | 2201313133003001210201 |
5 | 2424221222041111002 |
6 | 35354005232301105 |
7 | 2225432346501365 |
oct | 241673703014441 |
9 | 43341421837315 |
10 | 11123412441377 |
11 | 35a945a377815 |
12 | 12b79603a1795 |
13 | 628c1959c0b2 |
14 | 2a6539ba72a5 |
15 | 14452b023852 |
hex | a1ddf0c1921 |
11123412441377 has 2 divisors, whose sum is σ = 11123412441378. Its totient is φ = 11123412441376.
The previous prime is 11123412441359. The next prime is 11123412441523. The reversal of 11123412441377 is 77314421432111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10599686672656 + 523725768721 = 3255716^2 + 723689^2 .
It is a cyclic number.
It is not a de Polignac number, because 11123412441377 - 26 = 11123412441313 is a prime.
It is a super-2 number, since 2×111234124413772 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11123412441307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5561706220688 + 5561706220689.
It is an arithmetic number, because the mean of its divisors is an integer number (5561706220689).
Almost surely, 211123412441377 is an apocalyptic number.
It is an amenable number.
11123412441377 is a deficient number, since it is larger than the sum of its proper divisors (1).
11123412441377 is an equidigital number, since it uses as much as digits as its factorization.
11123412441377 is an evil number, because the sum of its binary digits is even.
The product of its digits is 112896, while the sum is 41.
Adding to 11123412441377 its reverse (77314421432111), we get a palindrome (88437833873488).
The spelling of 11123412441377 in words is "eleven trillion, one hundred twenty-three billion, four hundred twelve million, four hundred forty-one thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •