Base | Representation |
---|---|
bin | 1010000111010001101000… |
… | …1110000001001111100000 |
3 | 1110101001221121012122100011 |
4 | 2201310122032001033200 |
5 | 2424142441203241224 |
6 | 35352301430134304 |
7 | 2225254461142600 |
oct | 241643216011740 |
9 | 43331847178304 |
10 | 11120110212064 |
11 | 35a801534aa87 |
12 | 12b719a4b1394 |
13 | 6288113b9159 |
14 | 2a63053aac00 |
15 | 1443d6180394 |
hex | a1d1a3813e0 |
11120110212064 has 36 divisors (see below), whose sum is σ = 25467038123184. Its totient is φ = 4765761518784.
The previous prime is 11120110211789. The next prime is 11120110212073. The reversal of 11120110212064 is 46021201102111.
It is a happy number.
It is a super-2 number, since 2×111201102120642 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3545951944 + ... + 3545955079.
It is an arithmetic number, because the mean of its divisors is an integer number (707417725644).
Almost surely, 211120110212064 is an apocalyptic number.
11120110212064 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
11120110212064 is an abundant number, since it is smaller than the sum of its proper divisors (14346927911120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11120110212064 is an equidigital number, since it uses as much as digits as its factorization.
11120110212064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7091907047 (or 7091907032 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 22.
Adding to 11120110212064 its reverse (46021201102111), we get a palindrome (57141311314175).
The spelling of 11120110212064 in words is "eleven trillion, one hundred twenty billion, one hundred ten million, two hundred twelve thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •