Base | Representation |
---|---|
bin | 10100100110000010… |
… | …11101001100000001 |
3 | 1001112112212210122000 |
4 | 22103001131030001 |
5 | 140120440121131 |
6 | 5025044334213 |
7 | 540664161222 |
oct | 122301351401 |
9 | 31475783560 |
10 | 11056567041 |
11 | 4764164513 |
12 | 21869a4369 |
13 | 1072871b80 |
14 | 76c5d7249 |
15 | 44aa14ce6 |
hex | 29305d301 |
11056567041 has 32 divisors (see below), whose sum is σ = 17779077120. Its totient is φ = 6750438912.
The previous prime is 11056566991. The next prime is 11056567073. The reversal of 11056567041 is 14076565011.
It is a happy number.
11056567041 is a `hidden beast` number, since 1 + 1 + 0 + 56 + 567 + 0 + 41 = 666.
It is not a de Polignac number, because 11056567041 - 229 = 10519696129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11056566987 and 11056567005.
It is not an unprimeable number, because it can be changed into a prime (11056567091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 79440 + ... + 168593.
It is an arithmetic number, because the mean of its divisors is an integer number (555596160).
Almost surely, 211056567041 is an apocalyptic number.
It is an amenable number.
11056567041 is a deficient number, since it is larger than the sum of its proper divisors (6722510079).
11056567041 is a wasteful number, since it uses less digits than its factorization.
11056567041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248182 (or 248176 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 36.
The spelling of 11056567041 in words is "eleven billion, fifty-six million, five hundred sixty-seven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •