Base | Representation |
---|---|
bin | 1010000111011101100001… |
… | …1000011010000001100101 |
3 | 1110101101011221111110010111 |
4 | 2201313120120122001211 |
5 | 2424221004423343203 |
6 | 35353550155253021 |
7 | 2225426521064026 |
oct | 241673030320145 |
9 | 43341157443114 |
10 | 11123300606053 |
11 | 35a9402232229 |
12 | 12b792aa4a171 |
13 | 628bcc37354c |
14 | 2a6528db4c4d |
15 | 1445212d226d |
hex | a1dd861a065 |
11123300606053 has 2 divisors, whose sum is σ = 11123300606054. Its totient is φ = 11123300606052.
The previous prime is 11123300606009. The next prime is 11123300606087. The reversal of 11123300606053 is 35060600332111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5792382987169 + 5330917618884 = 2406737^2 + 2308878^2 .
It is a cyclic number.
It is not a de Polignac number, because 11123300606053 - 233 = 11114710671461 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11123300601053) 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, 5561650303026 + 5561650303027.
It is an arithmetic number, because the mean of its divisors is an integer number (5561650303027).
Almost surely, 211123300606053 is an apocalyptic number.
It is an amenable number.
11123300606053 is a deficient number, since it is larger than the sum of its proper divisors (1).
11123300606053 is an equidigital number, since it uses as much as digits as its factorization.
11123300606053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 31.
Adding to 11123300606053 its reverse (35060600332111), we get a palindrome (46183900938164).
The spelling of 11123300606053 in words is "eleven trillion, one hundred twenty-three billion, three hundred million, six hundred six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •