Base | Representation |
---|---|
bin | 1010000111010010011010… |
… | …1111100001111000100111 |
3 | 1110101002111020120101111210 |
4 | 2201310212233201320213 |
5 | 2424143404000314421 |
6 | 35352334333402503 |
7 | 2225262622101336 |
oct | 241644657417047 |
9 | 43332436511453 |
10 | 11120320323111 |
11 | 35a8112a0957a |
12 | 12b7238939433 |
13 | 628845aa370c |
14 | 2a6325261d1d |
15 | 1443e9835576 |
hex | a1d26be1e27 |
11120320323111 has 8 divisors (see below), whose sum is σ = 15106850250480. Its totient is φ = 7273668638912.
The previous prime is 11120320323089. The next prime is 11120320323121. The reversal of 11120320323111 is 11132302302111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11120320323111 - 227 = 11120186105383 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120320323121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34969560606 + ... + 34969560923.
It is an arithmetic number, because the mean of its divisors is an integer number (1888356281310).
Almost surely, 211120320323111 is an apocalyptic number.
11120320323111 is a deficient number, since it is larger than the sum of its proper divisors (3986529927369).
11120320323111 is an equidigital number, since it uses as much as digits as its factorization.
11120320323111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69939121585.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 11120320323111 its reverse (11132302302111), we get a palindrome (22252622625222).
The spelling of 11120320323111 in words is "eleven trillion, one hundred twenty billion, three hundred twenty million, three hundred twenty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •