Base | Representation |
---|---|
bin | 10100110001011011… |
… | …00001000111100001 |
3 | 1001210012110110220122 |
4 | 22120231201013201 |
5 | 140314403103203 |
6 | 5042334050025 |
7 | 543233315615 |
oct | 123055410741 |
9 | 31705413818 |
10 | 11152003553 |
11 | 4803019369 |
12 | 21b2949915 |
13 | 1089578492 |
14 | 77b15b345 |
15 | 4540b7538 |
hex | 298b611e1 |
11152003553 has 4 divisors (see below), whose sum is σ = 11808003780. Its totient is φ = 10496003328.
The previous prime is 11152003547. The next prime is 11152003571. The reversal of 11152003553 is 35530025111.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 9151409569 + 2000593984 = 95663^2 + 44728^2 .
It is a cyclic number.
It is not a de Polignac number, because 11152003553 - 28 = 11152003297 is a prime.
It is a super-2 number, since 2×111520035532 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11152003153) 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, 328000088 + ... + 328000121.
It is an arithmetic number, because the mean of its divisors is an integer number (2952000945).
Almost surely, 211152003553 is an apocalyptic number.
It is an amenable number.
11152003553 is a deficient number, since it is larger than the sum of its proper divisors (656000227).
11152003553 is an equidigital number, since it uses as much as digits as its factorization.
11152003553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 656000226.
The product of its (nonzero) digits is 2250, while the sum is 26.
Adding to 11152003553 its reverse (35530025111), we get a palindrome (46682028664).
The spelling of 11152003553 in words is "eleven billion, one hundred fifty-two million, three thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •