Base | Representation |
---|---|
bin | 10100111011100011… |
… | …11110110111011001 |
3 | 1002000010111210111112 |
4 | 22131301332313121 |
5 | 141003141410212 |
6 | 5055013110105 |
7 | 545315302016 |
oct | 123561766731 |
9 | 32003453445 |
10 | 11237060057 |
11 | 48470335a3 |
12 | 2217328335 |
13 | 10a1089282 |
14 | 78857c70d |
15 | 45b7b9422 |
hex | 29dc7edd9 |
11237060057 has 2 divisors, whose sum is σ = 11237060058. Its totient is φ = 11237060056.
The previous prime is 11237059991. The next prime is 11237060059. The reversal of 11237060057 is 75006073211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7337806921 + 3899253136 = 85661^2 + 62444^2 .
It is an emirp because it is prime and its reverse (75006073211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11237060057 is a prime.
Together with 11237060059, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (11237060059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5618530028 + 5618530029.
It is an arithmetic number, because the mean of its divisors is an integer number (5618530029).
Almost surely, 211237060057 is an apocalyptic number.
It is an amenable number.
11237060057 is a deficient number, since it is larger than the sum of its proper divisors (1).
11237060057 is an equidigital number, since it uses as much as digits as its factorization.
11237060057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8820, while the sum is 32.
Subtracting from 11237060057 its sum of digits (32), we obtain a square (11237060025 = 1060052).
The spelling of 11237060057 in words is "eleven billion, two hundred thirty-seven million, sixty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •