Base | Representation |
---|---|
bin | 101010011111… |
… | …110001110100 |
3 | 202221222111110 |
4 | 222133301310 |
5 | 10322441322 |
6 | 1034435020 |
7 | 163455516 |
oct | 52376164 |
9 | 22858443 |
10 | 11140212 |
11 | 6319896 |
12 | 3892a70 |
13 | 2400855 |
14 | 169dbb6 |
15 | ea0c0c |
hex | a9fc74 |
11140212 has 12 divisors (see below), whose sum is σ = 25993856. Its totient is φ = 3713400.
The previous prime is 11140193. The next prime is 11140231. The reversal of 11140212 is 21204111.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (11140193) and next prime (11140231).
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 928351 = 11140212 / (1 + 1 + 1 + 4 + 0 + 2 + 1 + 2).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 464164 + ... + 464187.
Almost surely, 211140212 is an apocalyptic number.
11140212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11140212 is an abundant number, since it is smaller than the sum of its proper divisors (14853644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11140212 is a wasteful number, since it uses less digits than its factorization.
11140212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 928358 (or 928356 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
The square root of 11140212 is about 3337.6956122451. The cubic root of 11140212 is about 223.3389578049.
Adding to 11140212 its reverse (21204111), we get a palindrome (32344323).
The spelling of 11140212 in words is "eleven million, one hundred forty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •