Base | Representation |
---|---|
bin | 1010000110110111100110… |
… | …1100001110101001110000 |
3 | 1110100101220120201022210012 |
4 | 2201231321230032221300 |
5 | 2424034133220012430 |
6 | 35345144153154052 |
7 | 2224616344453514 |
oct | 241557154165160 |
9 | 43311816638705 |
10 | 11113122032240 |
11 | 35a505973a058 |
12 | 12b596a0bb928 |
13 | 627c696913c7 |
14 | 2a5c4124a144 |
15 | 1441278ed695 |
hex | a1b79b0ea70 |
11113122032240 has 160 divisors (see below), whose sum is σ = 29066170092480. Its totient is φ = 3930319798272.
The previous prime is 11113122032231. The next prime is 11113122032261. The reversal of 11113122032240 is 4223022131111.
11113122032240 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2348462 + ... + 5267021.
It is an arithmetic number, because the mean of its divisors is an integer number (181663563078).
Almost surely, 211113122032240 is an apocalyptic number.
11113122032240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11113122032240 is an abundant number, since it is smaller than the sum of its proper divisors (17953048060240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11113122032240 is a wasteful number, since it uses less digits than its factorization.
11113122032240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7615579 (or 7615573 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 11113122032240 its reverse (4223022131111), we get a palindrome (15336144163351).
The spelling of 11113122032240 in words is "eleven trillion, one hundred thirteen billion, one hundred twenty-two million, thirty-two thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •