Base | Representation |
---|---|
bin | 10100111110011011… |
… | …10010010110111101 |
3 | 1002001210210110212121 |
4 | 22133031302112331 |
5 | 141030322013302 |
6 | 5101233002541 |
7 | 546026664235 |
oct | 123715622675 |
9 | 32053713777 |
10 | 11261126077 |
11 | 4859680773 |
12 | 22233b3451 |
13 | 10a6064316 |
14 | 78b844cc5 |
15 | 45d96ee37 |
hex | 29f3725bd |
11261126077 has 4 divisors (see below), whose sum is σ = 11923545276. Its totient is φ = 10598706880.
The previous prime is 11261126059. The next prime is 11261126087. The reversal of 11261126077 is 77062116211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 77062116211 = 53791 ⋅1432621.
It can be written as a sum of positive squares in 2 ways, for example, as 7366617241 + 3894508836 = 85829^2 + 62406^2 .
It is a cyclic number.
It is not a de Polignac number, because 11261126077 - 223 = 11252737469 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11261126057) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 331209574 + ... + 331209607.
It is an arithmetic number, because the mean of its divisors is an integer number (2980886319).
Almost surely, 211261126077 is an apocalyptic number.
11261126077 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
11261126077 is a deficient number, since it is larger than the sum of its proper divisors (662419199).
11261126077 is an equidigital number, since it uses as much as digits as its factorization.
11261126077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 662419198.
The product of its (nonzero) digits is 7056, while the sum is 34.
The spelling of 11261126077 in words is "eleven billion, two hundred sixty-one million, one hundred twenty-six thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •