Base | Representation |
---|---|
bin | 101010100010… |
… | …101100011001 |
3 | 202222120212201 |
4 | 222202230121 |
5 | 10323332103 |
6 | 1035010201 |
7 | 163535365 |
oct | 52425431 |
9 | 22876781 |
10 | 11152153 |
11 | 6327861 |
12 | 3899961 |
13 | 240610c |
14 | 16a42a5 |
15 | ea451d |
hex | aa2b19 |
11152153 has 8 divisors (see below), whose sum is σ = 12215880. Its totient is φ = 10133760.
The previous prime is 11152147. The next prime is 11152177. The reversal of 11152153 is 35125111.
It can be written as a sum of positive squares in 4 ways, for example, as 6538249 + 4613904 = 2557^2 + 2148^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11152153 - 217 = 11021081 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11152153.
It is not an unprimeable number, because it can be changed into a prime (11152103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10818 + ... + 11803.
It is an arithmetic number, because the mean of its divisors is an integer number (1526985).
Almost surely, 211152153 is an apocalyptic number.
It is an amenable number.
11152153 is a deficient number, since it is larger than the sum of its proper divisors (1063727).
11152153 is a wasteful number, since it uses less digits than its factorization.
11152153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22667.
The product of its digits is 150, while the sum is 19.
The square root of 11152153 is about 3339.4839421683. The cubic root of 11152153 is about 223.4187270289.
Adding to 11152153 its reverse (35125111), we get a palindrome (46277264).
The spelling of 11152153 in words is "eleven million, one hundred fifty-two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •