Base | Representation |
---|---|
bin | 10101111101100111… |
… | …01100001101010001 |
3 | 1010102202010210022022 |
4 | 22332303230031101 |
5 | 143122013443144 |
6 | 5230005221225 |
7 | 565124113151 |
oct | 127663541521 |
9 | 33382123268 |
10 | 11791156049 |
11 | 5000889072 |
12 | 2350a01815 |
13 | 115bb01c1a |
14 | 7dbdb6761 |
15 | 49026acee |
hex | 2becec351 |
11791156049 has 4 divisors (see below), whose sum is σ = 11803225764. Its totient is φ = 11779086336.
The previous prime is 11791156037. The next prime is 11791156061. The reversal of 11791156049 is 94065119711.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (11791156037) and next prime (11791156061).
It can be written as a sum of positive squares in 2 ways, for example, as 6832179649 + 4958976400 = 82657^2 + 70420^2 .
It is a cyclic number.
It is not a de Polignac number, because 11791156049 - 216 = 11791090513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11791156009) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 6033392 + ... + 6035345.
It is an arithmetic number, because the mean of its divisors is an integer number (2950806441).
Almost surely, 211791156049 is an apocalyptic number.
It is an amenable number.
11791156049 is a deficient number, since it is larger than the sum of its proper divisors (12069715).
11791156049 is an equidigital number, since it uses as much as digits as its factorization.
11791156049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12069714.
The product of its (nonzero) digits is 68040, while the sum is 44.
The spelling of 11791156049 in words is "eleven billion, seven hundred ninety-one million, one hundred fifty-six thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •