Base | Representation |
---|---|
bin | 1010001100101100000101… |
… | …1101010000000101011110 |
3 | 1110200221222221022021200110 |
4 | 2203023001131100011132 |
5 | 2432203422220011220 |
6 | 35503122021110450 |
7 | 2235056220023163 |
oct | 243130135200536 |
9 | 43627887267613 |
10 | 11213110313310 |
11 | 36334a94a0594 |
12 | 1311213b58426 |
13 | 634512929a69 |
14 | 2aaa088da06a |
15 | 146a2aac0be0 |
hex | a32c175015e |
11213110313310 has 64 divisors (see below), whose sum is σ = 26933170166784. Its totient is φ = 2987751600000.
The previous prime is 11213110313233. The next prime is 11213110313333. The reversal of 11213110313310 is 1331301131211.
It is a super-2 number, since 2×112131103133102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 498327060 + ... + 498349560.
It is an arithmetic number, because the mean of its divisors is an integer number (420830783856).
Almost surely, 211213110313310 is an apocalyptic number.
11213110313310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11213110313310 is an abundant number, since it is smaller than the sum of its proper divisors (15720059853474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11213110313310 is a wasteful number, since it uses less digits than its factorization.
11213110313310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35169.
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 11213110313310 its reverse (1331301131211), we get a palindrome (12544411444521).
The spelling of 11213110313310 in words is "eleven trillion, two hundred thirteen billion, one hundred ten million, three hundred thirteen thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •