Base | Representation |
---|---|
bin | 1010000000111011010110… |
… | …1110010111011111000000 |
3 | 1102222122110000012101010210 |
4 | 2200032311232113133000 |
5 | 2420401112300314220 |
6 | 35230223451354120 |
7 | 2214344040546465 |
oct | 240166556273700 |
9 | 42878400171123 |
10 | 11011050010560 |
11 | 356583a745446 |
12 | 129a022452940 |
13 | 61b45080b842 |
14 | 2a0d1ad4366c |
15 | 1416518266e0 |
hex | a03b5b977c0 |
11011050010560 has 112 divisors (see below), whose sum is σ = 35352893988000. Its totient is φ = 2903288070144.
The previous prime is 11011050010529. The next prime is 11011050010573. The reversal of 11011050010560 is 6501005011011.
It is a happy number.
11011050010560 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×110110500105602 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 64351885 + ... + 64522764.
Almost surely, 211011050010560 is an apocalyptic number.
11011050010560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11011050010560 is an abundant number, since it is smaller than the sum of its proper divisors (24341843977440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011050010560 is a wasteful number, since it uses less digits than its factorization.
11011050010560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128874758 (or 128874748 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 11011050010560 its reverse (6501005011011), we get a palindrome (17512055021571).
The spelling of 11011050010560 in words is "eleven trillion, eleven billion, fifty million, ten thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •