Base | Representation |
---|---|
bin | 10100101101101110… |
… | …10000011010000001 |
3 | 1001201001010102221011 |
4 | 22112313100122001 |
5 | 140233434031423 |
6 | 5035305400521 |
7 | 542405646454 |
oct | 122667203201 |
9 | 31631112834 |
10 | 11121002113 |
11 | 4797574541 |
12 | 21a4499141 |
13 | 1083012730 |
14 | 776dab49b |
15 | 4514e1b0d |
hex | 296dd0681 |
11121002113 has 8 divisors (see below), whose sum is σ = 12497179968. Its totient is φ = 9819212304.
The previous prime is 11121002111. The next prime is 11121002147. The reversal of 11121002113 is 31120012111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11121002113 - 21 = 11121002111 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 11121002093 and 11121002102.
It is not an unprimeable number, because it can be changed into a prime (11121002111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18596695 + ... + 18597292.
It is an arithmetic number, because the mean of its divisors is an integer number (1562147496).
Almost surely, 211121002113 is an apocalyptic number.
11121002113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11121002113 is a deficient number, since it is larger than the sum of its proper divisors (1376177855).
11121002113 is a wasteful number, since it uses less digits than its factorization.
11121002113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37194023.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11121002113 its reverse (31120012111), we get a palindrome (42241014224).
The spelling of 11121002113 in words is "eleven billion, one hundred twenty-one million, two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •