Base | Representation |
---|---|
bin | 1010000111010010011101… |
… | …0101010000011101110001 |
3 | 1110101002111221011212012121 |
4 | 2201310213111100131301 |
5 | 2424143414013310413 |
6 | 35352335325354241 |
7 | 2225263102132453 |
oct | 241644725203561 |
9 | 43332457155177 |
10 | 11120330213233 |
11 | 35a811855412a |
12 | 12b7240108981 |
13 | 628847b57267 |
14 | 2a63266b82d3 |
15 | 1443ea63ab8d |
hex | a1d27550771 |
11120330213233 has 8 divisors (see below), whose sum is σ = 11144680848288. Its totient is φ = 11096006179104.
The previous prime is 11120330213207. The next prime is 11120330213261. The reversal of 11120330213233 is 33231203302111.
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-11120330213233 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11120330213198 and 11120330213207.
It is not an unprimeable number, because it can be changed into a prime (11120330213533) 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, 5813116 + ... + 7485517.
It is an arithmetic number, because the mean of its divisors is an integer number (1393085106036).
Almost surely, 211120330213233 is an apocalyptic number.
It is an amenable number.
11120330213233 is a deficient number, since it is larger than the sum of its proper divisors (24350635055).
11120330213233 is an equidigital number, since it uses as much as digits as its factorization.
11120330213233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13300463.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 11120330213233 its reverse (33231203302111), we get a palindrome (44351533515344).
The spelling of 11120330213233 in words is "eleven trillion, one hundred twenty billion, three hundred thirty million, two hundred thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •