Base | Representation |
---|---|
bin | 101011111010… |
… | …110011011111 |
3 | 210122220221110 |
4 | 223322303133 |
5 | 10421404210 |
6 | 1050433103 |
7 | 166600521 |
oct | 53726337 |
9 | 23586843 |
10 | 11513055 |
11 | 6553a24 |
12 | 3a32793 |
13 | 2501478 |
14 | 1759a11 |
15 | 1026420 |
hex | afacdf |
11513055 has 8 divisors (see below), whose sum is σ = 18420912. Its totient is φ = 6140288.
The previous prime is 11513053. The next prime is 11513057. The reversal of 11513055 is 55031511.
It is an interprime number because it is at equal distance from previous prime (11513053) and next prime (11513057).
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 11513055 - 21 = 11513053 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11513053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 383754 + ... + 383783.
It is an arithmetic number, because the mean of its divisors is an integer number (2302614).
Almost surely, 211513055 is an apocalyptic number.
11513055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11513055 is a deficient number, since it is larger than the sum of its proper divisors (6907857).
11513055 is an equidigital number, since it uses as much as digits as its factorization.
11513055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 767545.
The product of its (nonzero) digits is 375, while the sum is 21.
The square root of 11513055 is about 3393.0893003279. The cubic root of 11513055 is about 225.8032524245.
Adding to 11513055 its reverse (55031511), we get a palindrome (66544566).
The spelling of 11513055 in words is "eleven million, five hundred thirteen thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •