Base | Representation |
---|---|
bin | 101010110010… |
… | …011101001110 |
3 | 210002212110000 |
4 | 222302131032 |
5 | 10332413333 |
6 | 1040225130 |
7 | 164224542 |
oct | 52623516 |
9 | 23085400 |
10 | 11216718 |
11 | 6371317 |
12 | 390b1a6 |
13 | 2429616 |
14 | 16bda22 |
15 | eb8713 |
hex | ab274e |
11216718 has 20 divisors (see below), whose sum is σ = 25134120. Its totient is φ = 3738852.
The previous prime is 11216717. The next prime is 11216729. The reversal of 11216718 is 81761211.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 11216691 and 11216700.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11216713) 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 9 ways as a sum of consecutive naturals, for example, 34458 + ... + 34781.
It is an arithmetic number, because the mean of its divisors is an integer number (1256706).
Almost surely, 211216718 is an apocalyptic number.
11216718 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
11216718 is an abundant number, since it is smaller than the sum of its proper divisors (13917402).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11216718 is an equidigital number, since it uses as much as digits as its factorization.
11216718 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69253 (or 69244 counting only the distinct ones).
The product of its digits is 672, while the sum is 27.
The square root of 11216718 is about 3349.1369037410. The cubic root of 11216718 is about 223.8490559399.
Adding to 11216718 its reverse (81761211), we get a palindrome (92977929).
The spelling of 11216718 in words is "eleven million, two hundred sixteen thousand, seven hundred eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •