Base | Representation |
---|---|
bin | 1010000111010011101000… |
… | …0111011110001001000101 |
3 | 1110101010022220012021222221 |
4 | 2201310322013132021011 |
5 | 2424200040203210331 |
6 | 35352430504252341 |
7 | 2225303646653260 |
oct | 241647207361105 |
9 | 43333286167887 |
10 | 11120645366341 |
11 | 35a826a438345 |
12 | 12b73097710b1 |
13 | 62889822c2a4 |
14 | 2a63564b3cd7 |
15 | 14441813e711 |
hex | a1d3a1de245 |
11120645366341 has 8 divisors (see below), whose sum is σ = 12709606008960. Its totient is φ = 9531758978448.
The previous prime is 11120645366269. The next prime is 11120645366351. The reversal of 11120645366341 is 14366354602111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11120645366341 - 29 = 11120645365829 is a prime.
It is a super-3 number, since 3×111206453663413 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120645366351) 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, 18242386 + ... + 18842131.
It is an arithmetic number, because the mean of its divisors is an integer number (1588700751120).
Almost surely, 211120645366341 is an apocalyptic number.
It is an amenable number.
11120645366341 is a deficient number, since it is larger than the sum of its proper divisors (1588960642619).
11120645366341 is an equidigital number, since it uses as much as digits as its factorization.
11120645366341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37127363.
The product of its (nonzero) digits is 311040, while the sum is 43.
Adding to 11120645366341 its reverse (14366354602111), we get a palindrome (25486999968452).
The spelling of 11120645366341 in words is "eleven trillion, one hundred twenty billion, six hundred forty-five million, three hundred sixty-six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •