Base | Representation |
---|---|
bin | 10100101100100010… |
… | …00110100111100111 |
3 | 1001200100022022100221 |
4 | 22112101012213213 |
5 | 140223404004201 |
6 | 5034311145211 |
7 | 542224642420 |
oct | 122621064747 |
9 | 31610268327 |
10 | 11111000551 |
11 | 4791963192 |
12 | 21a1075207 |
13 | 1080c20251 |
14 | 775926647 |
15 | 4506b84a1 |
hex | 2964469e7 |
11111000551 has 8 divisors (see below), whose sum is σ = 12872236064. Its totient is φ = 9393252480.
The previous prime is 11111000513. The next prime is 11111000587. The reversal of 11111000551 is 15500011111.
11111000551 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 11111000551 - 27 = 11111000423 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 (11111000051) 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, 10871310 + ... + 10872331.
It is an arithmetic number, because the mean of its divisors is an integer number (1609029508).
Almost surely, 211111000551 is an apocalyptic number.
11111000551 is a deficient number, since it is larger than the sum of its proper divisors (1761235513).
11111000551 is an equidigital number, since it uses as much as digits as its factorization.
11111000551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21743721.
The product of its (nonzero) digits is 25, while the sum is 16.
Adding to 11111000551 its reverse (15500011111), we get a palindrome (26611011662).
The spelling of 11111000551 in words is "eleven billion, one hundred eleven million, five hundred fifty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •