Base | Representation |
---|---|
bin | 10100101101110010… |
… | …01100011001101001 |
3 | 1001201002002020121112 |
4 | 22112321030121221 |
5 | 140234101304433 |
6 | 5035324320105 |
7 | 542413163246 |
oct | 122671143151 |
9 | 31632066545 |
10 | 11121509993 |
11 | 4797891080 |
12 | 21a46a3035 |
13 | 108315c959 |
14 | 7770a05cd |
15 | 451592348 |
hex | 296e4c669 |
11121509993 has 8 divisors (see below), whose sum is σ = 12133768896. Its totient is φ = 10109453200.
The previous prime is 11121509929. The next prime is 11121510047. The reversal of 11121509993 is 39990512111.
11121509993 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11121509993 - 26 = 11121509929 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11121509993.
It is not an unprimeable number, because it can be changed into a prime (11121506993) 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 7 ways as a sum of consecutive naturals, for example, 78980 + ... + 168762.
It is an arithmetic number, because the mean of its divisors is an integer number (1516721112).
Almost surely, 211121509993 is an apocalyptic number.
It is an amenable number.
11121509993 is a deficient number, since it is larger than the sum of its proper divisors (1012258903).
11121509993 is a wasteful number, since it uses less digits than its factorization.
11121509993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101055.
The product of its (nonzero) digits is 21870, while the sum is 41.
The spelling of 11121509993 in words is "eleven billion, one hundred twenty-one million, five hundred nine thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •