Base | Representation |
---|---|
bin | 1010000110110111100100… |
… | …1001110100011111110010 |
3 | 1110100101212221202001122000 |
4 | 2201231321021310133302 |
5 | 2424034123412342320 |
6 | 35345143231554430 |
7 | 2224616205005166 |
oct | 241557111643762 |
9 | 43311787661560 |
10 | 11113113012210 |
11 | 35a5054639190 |
12 | 12b596708ba16 |
13 | 627c67853901 |
14 | 2a5c3dd7cca6 |
15 | 144126c1ac90 |
hex | a1b792747f2 |
11113113012210 has 128 divisors (see below), whose sum is σ = 34230765369600. Its totient is φ = 2535612226560.
The previous prime is 11113113012181. The next prime is 11113113012229. The reversal of 11113113012210 is 1221031131111.
11113113012210 is a `hidden beast` number, since 1 + 11 + 131 + 1 + 301 + 221 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 110002125 + ... + 110103104.
It is an arithmetic number, because the mean of its divisors is an integer number (267427854450).
Almost surely, 211113113012210 is an apocalyptic number.
11113113012210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11113113012210 is an abundant number, since it is smaller than the sum of its proper divisors (23117652357390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11113113012210 is a wasteful number, since it uses less digits than its factorization.
11113113012210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 220105273 (or 220105267 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 11113113012210 its reverse (1221031131111), we get a palindrome (12334144143321).
The spelling of 11113113012210 in words is "eleven trillion, one hundred thirteen billion, one hundred thirteen million, twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.069 sec. • engine limits •