Base | Representation |
---|---|
bin | 1010000000111011010111… |
… | …0000010000010110000101 |
3 | 1102222122110001010112012210 |
4 | 2200032311300100112011 |
5 | 2420401112412134410 |
6 | 35230223510134033 |
7 | 2214344045010663 |
oct | 240166560202605 |
9 | 42878401115183 |
10 | 11011050505605 |
11 | 356583aa53377 |
12 | 129a022651319 |
13 | 61b450952c77 |
14 | 2a0d1b031c33 |
15 | 1416518c3220 |
hex | a03b5c10585 |
11011050505605 has 16 divisors (see below), whose sum is σ = 18225187044480. Its totient is φ = 5670058191168.
The previous prime is 11011050505583. The next prime is 11011050505643. The reversal of 11011050505605 is 50650505011011.
It is not a de Polignac number, because 11011050505605 - 28 = 11011050505349 is a prime.
It is a super-2 number, since 2×110110505056052 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
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, 12656379457 + ... + 12656380326.
It is an arithmetic number, because the mean of its divisors is an integer number (1139074190280).
Almost surely, 211011050505605 is an apocalyptic number.
11011050505605 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11011050505605 is a deficient number, since it is larger than the sum of its proper divisors (7214136538875).
11011050505605 is a wasteful number, since it uses less digits than its factorization.
11011050505605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25312759820.
The product of its (nonzero) digits is 3750, while the sum is 30.
Adding to 11011050505605 its reverse (50650505011011), we get a palindrome (61661555516616).
The spelling of 11011050505605 in words is "eleven trillion, eleven billion, fifty million, five hundred five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •