Base | Representation |
---|---|
bin | 1010000000111100011100… |
… | …0010010001011011011111 |
3 | 1102222200012020200210020021 |
4 | 2200033013002101123133 |
5 | 2420402211123110221 |
6 | 35230312344333011 |
7 | 2214354165302410 |
oct | 240170702213337 |
9 | 42880166623207 |
10 | 11011340441311 |
11 | 3565979683361 |
12 | 129a0a3774167 |
13 | 61b498a38b62 |
14 | 2a0d47745807 |
15 | 14166c095041 |
hex | a03c70916df |
11011340441311 has 16 divisors (see below), whose sum is σ = 12641546631168. Its totient is φ = 9395428500000.
The previous prime is 11011340441261. The next prime is 11011340441371. The reversal of 11011340441311 is 11314404311011.
It is a cyclic number.
It is not a de Polignac number, because 11011340441311 - 29 = 11011340440799 is a prime.
It is a super-2 number, since 2×110113404413112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011340441371) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28296561 + ... + 28683061.
It is an arithmetic number, because the mean of its divisors is an integer number (790096664448).
Almost surely, 211011340441311 is an apocalyptic number.
11011340441311 is a deficient number, since it is larger than the sum of its proper divisors (1630206189857).
11011340441311 is a wasteful number, since it uses less digits than its factorization.
11011340441311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404982.
The product of its (nonzero) digits is 576, while the sum is 25.
Adding to 11011340441311 its reverse (11314404311011), we get a palindrome (22325744752322).
It can be divided in two parts, 110113 and 40441311, that added together give a square (40551424 = 63682).
The spelling of 11011340441311 in words is "eleven trillion, eleven billion, three hundred forty million, four hundred forty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •