Base | Representation |
---|---|
bin | 10100100101111110… |
… | …11110101001001001 |
3 | 1001112111220110121200 |
4 | 22102333132221021 |
5 | 140120322024323 |
6 | 5025025254413 |
7 | 540656602113 |
oct | 122277365111 |
9 | 31474813550 |
10 | 11056048713 |
11 | 4763940046 |
12 | 2186794409 |
13 | 107271cc78 |
14 | 76c5003b3 |
15 | 44a961443 |
hex | 292fdea49 |
11056048713 has 24 divisors (see below), whose sum is σ = 16328777088. Its totient is φ = 7205408352.
The previous prime is 11056048697. The next prime is 11056048727. The reversal of 11056048713 is 31784065011.
11056048713 is a `hidden beast` number, since 1 + 1 + 0 + 560 + 4 + 87 + 13 = 666.
It is not a de Polignac number, because 11056048713 - 24 = 11056048697 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11056048793) 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 23 ways as a sum of consecutive naturals, for example, 356070 + ... + 385872.
It is an arithmetic number, because the mean of its divisors is an integer number (680365712).
Almost surely, 211056048713 is an apocalyptic number.
It is an amenable number.
11056048713 is a deficient number, since it is larger than the sum of its proper divisors (5272728375).
11056048713 is a wasteful number, since it uses less digits than its factorization.
11056048713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30733 (or 30730 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 36.
The spelling of 11056048713 in words is "eleven billion, fifty-six million, forty-eight thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •