Base | Representation |
---|---|
bin | 101010111011… |
… | …010110100001 |
3 | 210011201102110 |
4 | 222323112201 |
5 | 10340100103 |
6 | 1041105533 |
7 | 164436012 |
oct | 52732641 |
9 | 23151373 |
10 | 11253153 |
11 | 639672a |
12 | 39282a9 |
13 | 2440092 |
14 | 16cd009 |
15 | ec4403 |
hex | abb5a1 |
11253153 has 8 divisors (see below), whose sum is σ = 15028416. Its totient is φ = 7490000.
The previous prime is 11253127. The next prime is 11253157. The reversal of 11253153 is 35135211.
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 11253153 - 29 = 11252641 is a prime.
It is a super-6 number, since 6×112531536 (a number of 44 digits) contains 666666 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11253157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 573 + ... + 4778.
It is an arithmetic number, because the mean of its divisors is an integer number (1878552).
Almost surely, 211253153 is an apocalyptic number.
It is an amenable number.
11253153 is a deficient number, since it is larger than the sum of its proper divisors (3775263).
11253153 is an equidigital number, since it uses as much as digits as its factorization.
11253153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6055.
The product of its digits is 450, while the sum is 21.
The square root of 11253153 is about 3354.5719548103. The cubic root of 11253153 is about 224.0911685120.
Adding to 11253153 its reverse (35135211), we get a palindrome (46388364).
It can be divided in two parts, 1125 and 3153, that added together give a triangular number (4278 = T92).
The spelling of 11253153 in words is "eleven million, two hundred fifty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •