Base | Representation |
---|---|
bin | 1010000111010010011110… |
… | …0000101111010001100101 |
3 | 1110101002112010211202211221 |
4 | 2201310213200233101211 |
5 | 2424143420301114023 |
6 | 35352335514100341 |
7 | 2225263136536360 |
oct | 241644740572145 |
9 | 43332463752757 |
10 | 11120333223013 |
11 | 35a811a21a453 |
12 | 12b724111a6b1 |
13 | 62884866c1b1 |
14 | 2a6326c5d0d7 |
15 | 1443eaa3285d |
hex | a1d2782f465 |
11120333223013 has 4 divisors (see below), whose sum is σ = 12708952254880. Its totient is φ = 9531714191148.
The previous prime is 11120333223007. The next prime is 11120333223017. The reversal of 11120333223013 is 31032233302111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11120333223013 - 25 = 11120333222981 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120333223017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 794309515923 + ... + 794309515936.
It is an arithmetic number, because the mean of its divisors is an integer number (3177238063720).
Almost surely, 211120333223013 is an apocalyptic number.
It is an amenable number.
11120333223013 is a deficient number, since it is larger than the sum of its proper divisors (1588619031867).
11120333223013 is an equidigital number, since it uses as much as digits as its factorization.
11120333223013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1588619031866.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 11120333223013 its reverse (31032233302111), we get a palindrome (42152566525124).
The spelling of 11120333223013 in words is "eleven trillion, one hundred twenty billion, three hundred thirty-three million, two hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •