Base | Representation |
---|---|
bin | 10100100101100100… |
… | …11011001011100101 |
3 | 1001112021110121110000 |
4 | 22102302123023211 |
5 | 140113433023121 |
6 | 5024424051513 |
7 | 540615530226 |
oct | 122262331345 |
9 | 31467417400 |
10 | 11052626661 |
11 | 4761a12aaa |
12 | 2185603b99 |
13 | 1071ac249b |
14 | 76bc8d24d |
15 | 44a4d7526 |
hex | 292c9b2e5 |
11052626661 has 20 divisors (see below), whose sum is σ = 16781388844. Its totient is φ = 7247620800.
The previous prime is 11052626623. The next prime is 11052626677. The reversal of 11052626661 is 16662625011.
11052626661 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 4159476036 + 6893150625 = 64494^2 + 83025^2 .
It is not a de Polignac number, because 11052626661 - 26 = 11052626597 is a prime.
It is a super-2 number, since 2×110526266612 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11052622661) 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 in 19 ways as a sum of consecutive naturals, for example, 1113520 + ... + 1123401.
Almost surely, 211052626661 is an apocalyptic number.
It is an amenable number.
11052626661 is a deficient number, since it is larger than the sum of its proper divisors (5728762183).
11052626661 is an equidigital number, since it uses as much as digits as its factorization.
11052626661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2236994 (or 2236985 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The spelling of 11052626661 in words is "eleven billion, fifty-two million, six hundred twenty-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •