Base | Representation |
---|---|
bin | 101010011101… |
… | …100101010000 |
3 | 202221112011021 |
4 | 222131211100 |
5 | 10322144331 |
6 | 1034325224 |
7 | 163420345 |
oct | 52354520 |
9 | 22845137 |
10 | 11131216 |
11 | 6313058 |
12 | 3889814 |
13 | 23c9725 |
14 | 169a7cc |
15 | e9d211 |
hex | a9d950 |
11131216 has 10 divisors (see below), whose sum is σ = 21566762. Its totient is φ = 5565600.
The previous prime is 11131187. The next prime is 11131229. The reversal of 11131216 is 61213111.
It can be written as a sum of positive squares in only one way, i.e., 10497600 + 633616 = 3240^2 + 796^2 .
It is a Harshad number since it is a multiple of its sum of digits (16), and also a Moran number because the ratio is a prime number: 695701 = 11131216 / (1 + 1 + 1 + 3 + 1 + 2 + 1 + 6).
It is a self number, because there is not a number n which added to its sum of digits gives 11131216.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 347835 + ... + 347866.
Almost surely, 211131216 is an apocalyptic number.
11131216 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
11131216 is a deficient number, since it is larger than the sum of its proper divisors (10435546).
11131216 is an equidigital number, since it uses as much as digits as its factorization.
11131216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 695709 (or 695703 counting only the distinct ones).
The product of its digits is 36, while the sum is 16.
The square root of 11131216 is about 3336.3477037024. The cubic root of 11131216 is about 223.2788243496.
Adding to 11131216 its reverse (61213111), we get a palindrome (72344327).
The spelling of 11131216 in words is "eleven million, one hundred thirty-one thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •