Base | Representation |
---|---|
bin | 1010000110001110111101… |
… | …1111001110011100010110 |
3 | 1110022100202100021001222012 |
4 | 2201203233133032130112 |
5 | 2423344313114324420 |
6 | 35340141512104222 |
7 | 2224052125056512 |
oct | 241435737163426 |
9 | 43270670231865 |
10 | 11102213433110 |
11 | 35a047105a078 |
12 | 12b3824995072 |
13 | 626c1b689517 |
14 | 2a54c856d142 |
15 | 143bd9db5dc5 |
hex | a18ef7ce716 |
11102213433110 has 8 divisors (see below), whose sum is σ = 19983984179616. Its totient is φ = 4440885373240.
The previous prime is 11102213433097. The next prime is 11102213433119. The reversal of 11102213433110 is 1133431220111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×111022134331102 (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 (11102213433119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 555110671646 + ... + 555110671665.
It is an arithmetic number, because the mean of its divisors is an integer number (2497998022452).
Almost surely, 211102213433110 is an apocalyptic number.
11102213433110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11102213433110 is a deficient number, since it is larger than the sum of its proper divisors (8881770746506).
11102213433110 is a wasteful number, since it uses less digits than its factorization.
11102213433110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1110221343318.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 11102213433110 its reverse (1133431220111), we get a palindrome (12235644653221).
The spelling of 11102213433110 in words is "eleven trillion, one hundred two billion, two hundred thirteen million, four hundred thirty-three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •