Base | Representation |
---|---|
bin | 10100100101101001… |
… | …01100111010000101 |
3 | 1001112022120221020021 |
4 | 22102310230322011 |
5 | 140114111123212 |
6 | 5024444535141 |
7 | 540623564365 |
oct | 122264547205 |
9 | 31468527207 |
10 | 11053223557 |
11 | 4762290502 |
12 | 21858514b1 |
13 | 1071c7108c |
14 | 76bda69a5 |
15 | 44a5a4307 |
hex | 292d2ce85 |
11053223557 has 8 divisors (see below), whose sum is σ = 11819290392. Its totient is φ = 10300032000.
The previous prime is 11053223537. The next prime is 11053223561. The reversal of 11053223557 is 75532235011.
It can be written as a sum of positive squares in 4 ways, for example, as 3759038721 + 7294184836 = 61311^2 + 85406^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11053223557 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11053223537) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3217044 + ... + 3220477.
It is an arithmetic number, because the mean of its divisors is an integer number (1477411299).
Almost surely, 211053223557 is an apocalyptic number.
11053223557 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
11053223557 is a deficient number, since it is larger than the sum of its proper divisors (766066835).
11053223557 is a wasteful number, since it uses less digits than its factorization.
11053223557 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6437639.
The product of its (nonzero) digits is 31500, while the sum is 34.
Adding to 11053223557 its reverse (75532235011), we get a palindrome (86585458568).
The spelling of 11053223557 in words is "eleven billion, fifty-three million, two hundred twenty-three thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •