Base | Representation |
---|---|
bin | 101011001011… |
… | …000000000000 |
3 | 210021222100100 |
4 | 223023000000 |
5 | 10344122443 |
6 | 1042322400 |
7 | 165123615 |
oct | 53130000 |
9 | 23258310 |
10 | 11317248 |
11 | 642a8a8 |
12 | 3959400 |
13 | 24632c7 |
14 | 170850c |
15 | ed83d3 |
hex | acb000 |
11317248 has 78 divisors (see below), whose sum is σ = 32796764. Its totient is φ = 3760128.
The previous prime is 11317247. The next prime is 11317259. The reversal of 11317248 is 84271311.
It is not an unprimeable number, because it can be changed into a prime (11317247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 36711 + ... + 37017.
Almost surely, 211317248 is an apocalyptic number.
11317248 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11317248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16398382).
11317248 is an abundant number, since it is smaller than the sum of its proper divisors (21479516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11317248 is an equidigital number, since it uses as much as digits as its factorization.
11317248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337 (or 312 counting only the distinct ones).
The product of its digits is 1344, while the sum is 27.
The square root of 11317248 is about 3364.1117698436. Note that the first 3 decimals coincide. The cubic root of 11317248 is about 224.5158180861.
Adding to 11317248 its reverse (84271311), we get a palindrome (95588559).
The spelling of 11317248 in words is "eleven million, three hundred seventeen thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •