Base | Representation |
---|---|
bin | 1010000111011001111010… |
… | …0101101111101100001111 |
3 | 1110101021200101001120210101 |
4 | 2201312132211233230033 |
5 | 2424212013220233033 |
6 | 35353310041551531 |
7 | 2225363505552433 |
oct | 241663645575417 |
9 | 43337611046711 |
10 | 11122331024143 |
11 | 35a8a549a4a69 |
12 | 12b76ba1a55a7 |
13 | 628aa6526741 |
14 | 2a64763049c3 |
15 | 1444b610d97d |
hex | a1d9e96fb0f |
11122331024143 has 8 divisors (see below), whose sum is σ = 11159392017536. Its totient is φ = 11085279753600.
The previous prime is 11122331024131. The next prime is 11122331024149. The reversal of 11122331024143 is 34142013322111.
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 11122331024143 - 217 = 11122330893071 is a prime.
It is a super-2 number, since 2×111223310241432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11122331024149) 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, 135423 + ... + 4718368.
It is an arithmetic number, because the mean of its divisors is an integer number (1394924002192).
Almost surely, 211122331024143 is an apocalyptic number.
11122331024143 is a deficient number, since it is larger than the sum of its proper divisors (37060993393).
11122331024143 is an equidigital number, since it uses as much as digits as its factorization.
11122331024143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4861425.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 11122331024143 its reverse (34142013322111), we get a palindrome (45264344346254).
The spelling of 11122331024143 in words is "eleven trillion, one hundred twenty-two billion, three hundred thirty-one million, twenty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •