Base | Representation |
---|---|
bin | 1010000110010110110010… |
… | …0101011011011010111010 |
3 | 1110022120011121111001011110 |
4 | 2201211230211123122322 |
5 | 2423413112411224010 |
6 | 35341130044141150 |
7 | 2224155131304045 |
oct | 241455445333272 |
9 | 43276147431143 |
10 | 11104312211130 |
11 | 35a1348833066 |
12 | 12b410b8377b6 |
13 | 62719443a0c8 |
14 | 2a56471bbc5c |
15 | 143cae28b120 |
hex | a196c95b6ba |
11104312211130 has 32 divisors (see below), whose sum is σ = 26971437858624. Its totient is φ = 2925473417216.
The previous prime is 11104312211119. The next prime is 11104312211177. The reversal of 11104312211130 is 3111221340111.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11104312211097 and 11104312211106.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2229779079 + ... + 2229784058.
It is an arithmetic number, because the mean of its divisors is an integer number (842857433082).
Almost surely, 211104312211130 is an apocalyptic number.
11104312211130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11104312211130 is an abundant number, since it is smaller than the sum of its proper divisors (15867125647494).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11104312211130 is a wasteful number, since it uses less digits than its factorization.
11104312211130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4459563230.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 11104312211130 its reverse (3111221340111), we get a palindrome (14215533551241).
The spelling of 11104312211130 in words is "eleven trillion, one hundred four billion, three hundred twelve million, two hundred eleven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •