Base | Representation |
---|---|
bin | 101010111001… |
… | …001010111110 |
3 | 210011021011200 |
4 | 222321022332 |
5 | 10334303342 |
6 | 1041000330 |
7 | 164400663 |
oct | 52711276 |
9 | 23137150 |
10 | 11244222 |
11 | 638aa50 |
12 | 39230a6 |
13 | 2438cb2 |
14 | 16c9a6a |
15 | ec194c |
hex | ab92be |
11244222 has 48 divisors (see below), whose sum is σ = 26872560. Its totient is φ = 3369600.
The previous prime is 11244221. The next prime is 11244241. The reversal of 11244222 is 22244211.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 11244195 and 11244204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11244221) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21322 + ... + 21842.
It is an arithmetic number, because the mean of its divisors is an integer number (559845).
Almost surely, 211244222 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11244222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13436280).
11244222 is an abundant number, since it is smaller than the sum of its proper divisors (15628338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11244222 is a wasteful number, since it uses less digits than its factorization.
11244222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 649 (or 646 counting only the distinct ones).
The product of its digits is 256, while the sum is 18.
The square root of 11244222 is about 3353.2405222411. The cubic root of 11244222 is about 224.0318699340.
Adding to 11244222 its reverse (22244211), we get a palindrome (33488433).
The spelling of 11244222 in words is "eleven million, two hundred forty-four thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •