Base | Representation |
---|---|
bin | 10100111100000111… |
… | …01111000110000101 |
3 | 1002000110021020120202 |
4 | 22132003233012011 |
5 | 141010334322203 |
6 | 5055300540245 |
7 | 545402664353 |
oct | 123603570605 |
9 | 32013236522 |
10 | 11241714053 |
11 | 4849722179 |
12 | 22189b1685 |
13 | 10a202870b |
14 | 7890307d3 |
15 | 45bdd8388 |
hex | 29e0ef185 |
11241714053 has 2 divisors, whose sum is σ = 11241714054. Its totient is φ = 11241714052.
The previous prime is 11241713957. The next prime is 11241714061. The reversal of 11241714053 is 35041714211.
11241714053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6596201089 + 4645512964 = 81217^2 + 68158^2 .
It is a cyclic number.
It is not a de Polignac number, because 11241714053 - 220 = 11240665477 is a prime.
It is a super-2 number, since 2×112417140532 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11241711053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5620857026 + 5620857027.
It is an arithmetic number, because the mean of its divisors is an integer number (5620857027).
Almost surely, 211241714053 is an apocalyptic number.
It is an amenable number.
11241714053 is a deficient number, since it is larger than the sum of its proper divisors (1).
11241714053 is an equidigital number, since it uses as much as digits as its factorization.
11241714053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3360, while the sum is 29.
The spelling of 11241714053 in words is "eleven billion, two hundred forty-one million, seven hundred fourteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.269 sec. • engine limits •