Base | Representation |
---|---|
bin | 1010100001111001100010… |
… | …1000001001101101100001 |
3 | 1111222210112201010120022221 |
4 | 2220132120220021231201 |
5 | 3004141203331300324 |
6 | 40342343503431041 |
7 | 2303306116150246 |
oct | 250363050115541 |
9 | 44883481116287 |
10 | 11577497525089 |
11 | 3763a9758a001 |
12 | 136b9685b5481 |
13 | 65c9a40bbb42 |
14 | 2c04d503b5cd |
15 | 151255c420e4 |
hex | a8798a09b61 |
11577497525089 has 2 divisors, whose sum is σ = 11577497525090. Its totient is φ = 11577497525088.
The previous prime is 11577497525071. The next prime is 11577497525107. The reversal of 11577497525089 is 98052579477511.
It is a balanced prime because it is at equal distance from previous prime (11577497525071) and next prime (11577497525107).
It can be written as a sum of positive squares in only one way, i.e., 11473496435025 + 104001090064 = 3387255^2 + 322492^2 .
It is a cyclic number.
It is not a de Polignac number, because 11577497525089 - 211 = 11577497523041 is a prime.
It is not a weakly prime, because it can be changed into another prime (11577497525029) 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, 5788748762544 + 5788748762545.
It is an arithmetic number, because the mean of its divisors is an integer number (5788748762545).
Almost surely, 211577497525089 is an apocalyptic number.
It is an amenable number.
11577497525089 is a deficient number, since it is larger than the sum of its proper divisors (1).
11577497525089 is an equidigital number, since it uses as much as digits as its factorization.
11577497525089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 222264000, while the sum is 70.
The spelling of 11577497525089 in words is "eleven trillion, five hundred seventy-seven billion, four hundred ninety-seven million, five hundred twenty-five thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •