Base | Representation |
---|---|
bin | 10100110001111011… |
… | …10111001010000111 |
3 | 1001210111112011020212 |
4 | 22120331313022013 |
5 | 140322002210020 |
6 | 5043005550035 |
7 | 543314612246 |
oct | 123075671207 |
9 | 31714464225 |
10 | 11156288135 |
11 | 4805485443 |
12 | 21b427531b |
13 | 108a418735 |
14 | 77b95495d |
15 | 454661cc5 |
hex | 298f77287 |
11156288135 has 4 divisors (see below), whose sum is σ = 13387545768. Its totient is φ = 8925030504.
The previous prime is 11156288027. The next prime is 11156288147. The reversal of 11156288135 is 53188265111.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 53188265111 = 1483 ⋅35865317.
It is a cyclic number.
It is not a de Polignac number, because 11156288135 - 222 = 11152093831 is a prime.
It is a super-2 number, since 2×111562881352 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11156288092 and 11156288101.
It is a congruent number.
It is an unprimeable number.
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, 1115628809 + ... + 1115628818.
It is an arithmetic number, because the mean of its divisors is an integer number (3346886442).
Almost surely, 211156288135 is an apocalyptic number.
11156288135 is a deficient number, since it is larger than the sum of its proper divisors (2231257633).
11156288135 is an equidigital number, since it uses as much as digits as its factorization.
11156288135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2231257632.
The product of its digits is 57600, while the sum is 41.
The spelling of 11156288135 in words is "eleven billion, one hundred fifty-six million, two hundred eighty-eight thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •