Base | Representation |
---|---|
bin | 1010000000111000001111… |
… | …0010011000001010010110 |
3 | 1102222120021121201020122011 |
4 | 2200032003302120022112 |
5 | 2420342403310413420 |
6 | 35230004402254434 |
7 | 2214314215360363 |
oct | 240160362301226 |
9 | 42876247636564 |
10 | 11010212201110 |
11 | 356544a82a841 |
12 | 1299a2995741a |
13 | 61b34907b1c5 |
14 | 2a0c7b97546a |
15 | 141602ed195a |
hex | a0383c98296 |
11010212201110 has 32 divisors (see below), whose sum is σ = 20878025011200. Its totient is φ = 4168976876640.
The previous prime is 11010212201081. The next prime is 11010212201117. The reversal of 11010212201110 is 1110221201011.
It is a happy number.
It is a super-2 number, since 2×110102122011102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010212201117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22774486 + ... + 23252905.
It is an arithmetic number, because the mean of its divisors is an integer number (652438281600).
Almost surely, 211010212201110 is an apocalyptic number.
11010212201110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11010212201110 is a deficient number, since it is larger than the sum of its proper divisors (9867812810090).
11010212201110 is a wasteful number, since it uses less digits than its factorization.
11010212201110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46028676.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11010212201110 its reverse (1110221201011), we get a palindrome (12120433402121).
The spelling of 11010212201110 in words is "eleven trillion, ten billion, two hundred twelve million, two hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •