Base | Representation |
---|---|
bin | 1010011011111001011010… |
… | …1100001010001011100101 |
3 | 1111121221101200020112001001 |
4 | 2212332112230022023211 |
5 | 3000444020231243203 |
6 | 40223132101433301 |
7 | 2262665656044502 |
oct | 246762654121345 |
9 | 44557350215031 |
10 | 11474385806053 |
11 | 3724294718385 |
12 | 135399070b831 |
13 | 653050a10241 |
14 | 2b9512a124a9 |
15 | 14d71d74691d |
hex | a6f96b0a2e5 |
11474385806053 has 2 divisors, whose sum is σ = 11474385806054. Its totient is φ = 11474385806052.
The previous prime is 11474385805931. The next prime is 11474385806057. The reversal of 11474385806053 is 35060858347411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11454691332484 + 19694473569 = 3384478^2 + 140337^2 .
It is a cyclic number.
It is not a de Polignac number, because 11474385806053 - 217 = 11474385674981 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11474385805985 and 11474385806003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11474385806057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5737192903026 + 5737192903027.
It is an arithmetic number, because the mean of its divisors is an integer number (5737192903027).
Almost surely, 211474385806053 is an apocalyptic number.
It is an amenable number.
11474385806053 is a deficient number, since it is larger than the sum of its proper divisors (1).
11474385806053 is an equidigital number, since it uses as much as digits as its factorization.
11474385806053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9676800, while the sum is 55.
The spelling of 11474385806053 in words is "eleven trillion, four hundred seventy-four billion, three hundred eighty-five million, eight hundred six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •