Base | Representation |
---|---|
bin | 1010000111010010011001… |
… | …0011111111001101101011 |
3 | 1110101002110201222120200002 |
4 | 2201310212103333031223 |
5 | 2424143400123300321 |
6 | 35352333514533215 |
7 | 2225262503531144 |
oct | 241644623771553 |
9 | 43332421876602 |
10 | 11120313103211 |
11 | 35a8109928114 |
12 | 12b723643720b |
13 | 6288444463a0 |
14 | 2a6324302acb |
15 | 1443e8dab20b |
hex | a1d264ff36b |
11120313103211 has 8 divisors (see below), whose sum is σ = 11982156929904. Its totient is φ = 10259388580320.
The previous prime is 11120313103189. The next prime is 11120313103259. The reversal of 11120313103211 is 11230131302111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11120313103211 is a prime.
It is a super-2 number, since 2×111203131032112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11120313105211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 229800821 + ... + 229849206.
It is an arithmetic number, because the mean of its divisors is an integer number (1497769616238).
Almost surely, 211120313103211 is an apocalyptic number.
11120313103211 is a deficient number, since it is larger than the sum of its proper divisors (861843826693).
11120313103211 is a wasteful number, since it uses less digits than its factorization.
11120313103211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 459651901.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 11120313103211 its reverse (11230131302111), we get a palindrome (22350444405322).
The spelling of 11120313103211 in words is "eleven trillion, one hundred twenty billion, three hundred thirteen million, one hundred three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •