Base | Representation |
---|---|
bin | 10100100101111111… |
… | …00000010101010011 |
3 | 1001112111220211010001 |
4 | 22102333200111103 |
5 | 140120322240020 |
6 | 5025025350431 |
7 | 540656631232 |
oct | 122277402523 |
9 | 31474824101 |
10 | 11056055635 |
11 | 4763945269 |
12 | 2186798417 |
13 | 1072723171 |
14 | 76c502b19 |
15 | 44a96350a |
hex | 292fe0553 |
11056055635 has 16 divisors (see below), whose sum is σ = 14109530400. Its totient is φ = 8292934656.
The previous prime is 11056055629. The next prime is 11056055677. The reversal of 11056055635 is 53655065011.
11056055635 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11056055635 - 227 = 10921837907 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11056055594 and 11056055603.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 590680 + ... + 609109.
It is an arithmetic number, because the mean of its divisors is an integer number (881845650).
Almost surely, 211056055635 is an apocalyptic number.
11056055635 is a deficient number, since it is larger than the sum of its proper divisors (3053474765).
11056055635 is a wasteful number, since it uses less digits than its factorization.
11056055635 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1199910.
The product of its (nonzero) digits is 67500, while the sum is 37.
The spelling of 11056055635 in words is "eleven billion, fifty-six million, fifty-five thousand, six hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •