Base | Representation |
---|---|
bin | 10100100101111110… |
… | …11001010111100001 |
3 | 1001112111212100222101 |
4 | 22102333121113201 |
5 | 140120320331410 |
6 | 5025025010401 |
7 | 540656452114 |
oct | 122277312741 |
9 | 31474770871 |
10 | 11056027105 |
11 | 4763925892 |
12 | 2186783a01 |
13 | 1072713196 |
14 | 76c4d657b |
15 | 44a959d3a |
hex | 292fd95e1 |
11056027105 has 16 divisors (see below), whose sum is σ = 13586238864. Its totient is φ = 8633847040.
The previous prime is 11056027079. The next prime is 11056027109. The reversal of 11056027105 is 50172065011.
It can be written as a sum of positive squares in 8 ways, for example, as 880664976 + 10175362129 = 29676^2 + 100873^2 .
It is not a de Polignac number, because 11056027105 - 27 = 11056026977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11056027109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53686 + ... + 158095.
It is an arithmetic number, because the mean of its divisors is an integer number (849139929).
Almost surely, 211056027105 is an apocalyptic number.
It is an amenable number.
11056027105 is a deficient number, since it is larger than the sum of its proper divisors (2530211759).
11056027105 is a wasteful number, since it uses less digits than its factorization.
11056027105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212036.
The product of its (nonzero) digits is 2100, while the sum is 28.
The spelling of 11056027105 in words is "eleven billion, fifty-six million, twenty-seven thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •