Base | Representation |
---|---|
bin | 1010000001000011000111… |
… | …0100100110110101110111 |
3 | 1102222211211002212110200200 |
4 | 2200100301310212311313 |
5 | 2420414343244133421 |
6 | 35231210224211543 |
7 | 2214446451420213 |
oct | 240206164466567 |
9 | 42884732773620 |
10 | 11013132021111 |
11 | 3566708a06820 |
12 | 129a503769bb3 |
13 | 61b6c2c6b44c |
14 | 2a1077669943 |
15 | 1417244d8726 |
hex | a0431d26d77 |
11013132021111 has 96 divisors (see below), whose sum is σ = 17691045166080. Its totient is φ = 6546108441600.
The previous prime is 11013132020959. The next prime is 11013132021167. The reversal of 11013132021111 is 11112023131011.
11013132021111 is a `hidden beast` number, since 1 + 1 + 0 + 131 + 320 + 211 + 1 + 1 = 666.
It is not a de Polignac number, because 11013132021111 - 215 = 11013131988343 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11013132021181) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1494518235 + ... + 1494525603.
It is an arithmetic number, because the mean of its divisors is an integer number (184281720480).
Almost surely, 211013132021111 is an apocalyptic number.
11013132021111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11013132021111 is a deficient number, since it is larger than the sum of its proper divisors (6677913144969).
11013132021111 is a wasteful number, since it uses less digits than its factorization.
11013132021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8597 (or 8594 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 11013132021111 its reverse (11112023131011), we get a palindrome (22125155152122).
The spelling of 11013132021111 in words is "eleven trillion, thirteen billion, one hundred thirty-two million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •