Base | Representation |
---|---|
bin | 1010000000111100011001… |
… | …1010111010010101101001 |
3 | 1102222200011112021120022210 |
4 | 2200033012122322111221 |
5 | 2420402201002414423 |
6 | 35230311335235333 |
7 | 2214354011506245 |
oct | 240170632722551 |
9 | 42880145246283 |
10 | 11011330123113 |
11 | 3565973876121 |
12 | 129a0a0218b49 |
13 | 61b496865508 |
14 | 2a0d4621b425 |
15 | 14166b207b93 |
hex | a03c66ba569 |
11011330123113 has 8 divisors (see below), whose sum is σ = 15039865534176. Its totient is φ = 7161840730400.
The previous prime is 11011330123093. The next prime is 11011330123121. The reversal of 11011330123113 is 31132103311011.
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 11011330123113 - 28 = 11011330122857 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11011330123113.
It is not an unprimeable number, because it can be changed into a prime (11011330133113) 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, 44761504443 + ... + 44761504688.
It is an arithmetic number, because the mean of its divisors is an integer number (1879983191772).
Almost surely, 211011330123113 is an apocalyptic number.
It is an amenable number.
11011330123113 is a deficient number, since it is larger than the sum of its proper divisors (4028535411063).
11011330123113 is an equidigital number, since it uses as much as digits as its factorization.
11011330123113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89523009175.
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 11011330123113 its reverse (31132103311011), we get a palindrome (42143433434124).
The spelling of 11011330123113 in words is "eleven trillion, eleven billion, three hundred thirty million, one hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •