Base | Representation |
---|---|
bin | 10100101101001110… |
… | …10001111100010001 |
3 | 1001200202020200001110 |
4 | 22112213101330101 |
5 | 140231401022342 |
6 | 5035035523533 |
7 | 542325234504 |
oct | 122647217421 |
9 | 31622220043 |
10 | 11116814097 |
11 | 4795173a74 |
12 | 21a2bb95a9 |
13 | 10821a740c |
14 | 7765db13b |
15 | 450e65c9c |
hex | 2969d1f11 |
11116814097 has 8 divisors (see below), whose sum is σ = 15694325856. Its totient is φ = 6975255872.
The previous prime is 11116813973. The next prime is 11116814099. The reversal of 11116814097 is 79041861111.
11116814097 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 a cyclic number.
It is not a de Polignac number, because 11116814097 - 210 = 11116813073 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11116814099) 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, 108988323 + ... + 108988424.
It is an arithmetic number, because the mean of its divisors is an integer number (1961790732).
Almost surely, 211116814097 is an apocalyptic number.
11116814097 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
11116814097 is a deficient number, since it is larger than the sum of its proper divisors (4577511759).
11116814097 is a wasteful number, since it uses less digits than its factorization.
11116814097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217976767.
The product of its (nonzero) digits is 12096, while the sum is 39.
The spelling of 11116814097 in words is "eleven billion, one hundred sixteen million, eight hundred fourteen thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •