Base | Representation |
---|---|
bin | 1010011110000111100011… |
… | …1000110110111000010101 |
3 | 1111202120212202002000111202 |
4 | 2213201320320312320111 |
5 | 3002110140333232203 |
6 | 40252442121442245 |
7 | 2265516325563422 |
oct | 247417070667025 |
9 | 44676782060452 |
10 | 11512540524053 |
11 | 3739493aa3778 |
12 | 135b25a640385 |
13 | 6568216a995a |
14 | 2bb2d20bad49 |
15 | 14e70322d388 |
hex | a7878e36e15 |
11512540524053 has 2 divisors, whose sum is σ = 11512540524054. Its totient is φ = 11512540524052.
The previous prime is 11512540524047. The next prime is 11512540524109. The reversal of 11512540524053 is 35042504521511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9079994969809 + 2432545554244 = 3013303^2 + 1559662^2 .
It is a cyclic number.
It is not a de Polignac number, because 11512540524053 - 242 = 7114494012949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11512540523998 and 11512540524016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11512540124053) 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, 5756270262026 + 5756270262027.
It is an arithmetic number, because the mean of its divisors is an integer number (5756270262027).
Almost surely, 211512540524053 is an apocalyptic number.
It is an amenable number.
11512540524053 is a deficient number, since it is larger than the sum of its proper divisors (1).
11512540524053 is an equidigital number, since it uses as much as digits as its factorization.
11512540524053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120000, while the sum is 38.
The spelling of 11512540524053 in words is "eleven trillion, five hundred twelve billion, five hundred forty million, five hundred twenty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •