Base | Representation |
---|---|
bin | 10100100101010101… |
… | …00010111000100101 |
3 | 1001112010120122222022 |
4 | 22102222202320211 |
5 | 140112420423221 |
6 | 5024311512525 |
7 | 540562135121 |
oct | 122252427045 |
9 | 31463518868 |
10 | 11050561061 |
11 | 47608320a1 |
12 | 2184988745 |
13 | 107154b237 |
14 | 76b8b2581 |
15 | 44a22a4ab |
hex | 292aa2e25 |
11050561061 has 4 divisors (see below), whose sum is σ = 11055792972. Its totient is φ = 11045329152.
The previous prime is 11050561057. The next prime is 11050561073. The reversal of 11050561061 is 16016505011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2220200161 + 8830360900 = 47119^2 + 93970^2 .
It is a cyclic number.
It is not a de Polignac number, because 11050561061 - 22 = 11050561057 is a prime.
It is a super-2 number, since 2×110505610612 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11050561061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11050561031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2612786 + ... + 2617011.
It is an arithmetic number, because the mean of its divisors is an integer number (2763948243).
Almost surely, 211050561061 is an apocalyptic number.
It is an amenable number.
11050561061 is a deficient number, since it is larger than the sum of its proper divisors (5231911).
11050561061 is an equidigital number, since it uses as much as digits as its factorization.
11050561061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5231910.
The product of its (nonzero) digits is 900, while the sum is 26.
The spelling of 11050561061 in words is "eleven billion, fifty million, five hundred sixty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •