Base | Representation |
---|---|
bin | 101010010111… |
… | …010011101001 |
3 | 202220012220022 |
4 | 222113103221 |
5 | 10320334023 |
6 | 1034010225 |
7 | 163252406 |
oct | 52272351 |
9 | 22805808 |
10 | 11105513 |
11 | 62a5811 |
12 | 3876975 |
13 | 23bab13 |
14 | 16912ad |
15 | e957c8 |
hex | a974e9 |
11105513 has 4 divisors (see below), whose sum is σ = 11405700. Its totient is φ = 10805328.
The previous prime is 11105473. The next prime is 11105531. The reversal of 11105513 is 31550111.
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 9560464 + 1545049 = 3092^2 + 1243^2 .
It is a cyclic number.
It is not a de Polignac number, because 11105513 - 26 = 11105449 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11105491 and 11105500.
It is not an unprimeable number, because it can be changed into a prime (11105543) 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 3 ways as a sum of consecutive naturals, for example, 150038 + ... + 150111.
It is an arithmetic number, because the mean of its divisors is an integer number (2851425).
Almost surely, 211105513 is an apocalyptic number.
It is an amenable number.
11105513 is a deficient number, since it is larger than the sum of its proper divisors (300187).
11105513 is an equidigital number, since it uses as much as digits as its factorization.
11105513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300186.
The product of its (nonzero) digits is 75, while the sum is 17.
The square root of 11105513 is about 3332.4935108714. The cubic root of 11105513 is about 223.1068347982.
Adding to 11105513 its reverse (31550111), we get a palindrome (42655624).
The spelling of 11105513 in words is "eleven million, one hundred five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •