Base | Representation |
---|---|
bin | 101010110010… |
… | …010101101001 |
3 | 210002211210001 |
4 | 222302111221 |
5 | 10332404413 |
6 | 1040223001 |
7 | 164223250 |
oct | 52622551 |
9 | 23084701 |
10 | 11216233 |
11 | 6370a16 |
12 | 390aa61 |
13 | 2429332 |
14 | 16bd797 |
15 | eb84dd |
hex | ab2569 |
11216233 has 8 divisors (see below), whose sum is σ = 12839552. Its totient is φ = 9598176.
The previous prime is 11216201. The next prime is 11216239. The reversal of 11216233 is 33261211.
11216233 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11216233 - 25 = 11216201 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11216233.
It is not an unprimeable number, because it can be changed into a prime (11216239) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5941 + ... + 7597.
It is an arithmetic number, because the mean of its divisors is an integer number (1604944).
Almost surely, 211216233 is an apocalyptic number.
It is an amenable number.
11216233 is a deficient number, since it is larger than the sum of its proper divisors (1623319).
11216233 is an equidigital number, since it uses as much as digits as its factorization.
11216233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2631.
The product of its digits is 216, while the sum is 19.
The square root of 11216233 is about 3349.0644962437. The cubic root of 11216233 is about 223.8458295547.
Adding to 11216233 its reverse (33261211), we get a palindrome (44477444).
It can be divided in two parts, 11216 and 233, that added together give a square (11449 = 1072).
The spelling of 11216233 in words is "eleven million, two hundred sixteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •