Base | Representation |
---|---|
bin | 10101100000111000… |
… | …01100101110010111 |
3 | 1002210221120201120012 |
4 | 22300130030232113 |
5 | 142123312214014 |
6 | 5150035030435 |
7 | 556136241536 |
oct | 126034145627 |
9 | 32727521505 |
10 | 11550116759 |
11 | 4997815745 |
12 | 22a413b41b |
13 | 1120ba901c |
14 | 7b7d9031d |
15 | 479006c3e |
hex | 2b070cb97 |
11550116759 has 4 divisors (see below), whose sum is σ = 11552244216. Its totient is φ = 11547989304.
The previous prime is 11550116731. The next prime is 11550116789. The reversal of 11550116759 is 95761105511.
11550116759 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 95761105511 = 1409 ⋅67963879.
It is a cyclic number.
It is not a de Polignac number, because 11550116759 - 28 = 11550116503 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 (11550116719) 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 3 ways as a sum of consecutive naturals, for example, 1055564 + ... + 1066449.
It is an arithmetic number, because the mean of its divisors is an integer number (2888061054).
Almost surely, 211550116759 is an apocalyptic number.
11550116759 is a deficient number, since it is larger than the sum of its proper divisors (2127457).
11550116759 is an equidigital number, since it uses as much as digits as its factorization.
11550116759 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2127456.
The product of its (nonzero) digits is 47250, while the sum is 41.
The spelling of 11550116759 in words is "eleven billion, five hundred fifty million, one hundred sixteen thousand, seven hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •