Base | Representation |
---|---|
bin | 10100100100100111… |
… | …01000101100101001 |
3 | 1001111201021112222101 |
4 | 22102103220230221 |
5 | 140104401234221 |
6 | 5023535053401 |
7 | 540460113304 |
oct | 122223505451 |
9 | 31451245871 |
10 | 11044555561 |
11 | 4758400076 |
12 | 2182971261 |
13 | 10702278a0 |
14 | 76ab8bb3b |
15 | 449940d91 |
hex | 2924e8b29 |
11044555561 has 4 divisors (see below), whose sum is σ = 11894136772. Its totient is φ = 10194974352.
The previous prime is 11044555549. The next prime is 11044555603. The reversal of 11044555561 is 16555544011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16555544011 = 103 ⋅160733437.
It can be written as a sum of positive squares in 2 ways, for example, as 989479936 + 10055075625 = 31456^2 + 100275^2 .
It is a cyclic number.
It is not a de Polignac number, because 11044555561 - 233 = 2454620969 is a prime.
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 11044555561.
It is not an unprimeable number, because it can be changed into a prime (11044555061) 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, 424790586 + ... + 424790611.
It is an arithmetic number, because the mean of its divisors is an integer number (2973534193).
Almost surely, 211044555561 is an apocalyptic number.
It is an amenable number.
11044555561 is a deficient number, since it is larger than the sum of its proper divisors (849581211).
11044555561 is an equidigital number, since it uses as much as digits as its factorization.
11044555561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 849581210.
The product of its (nonzero) digits is 60000, while the sum is 37.
The spelling of 11044555561 in words is "eleven billion, forty-four million, five hundred fifty-five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •