Base | Representation |
---|---|
bin | 101010100000… |
… | …010010011100 |
3 | 202222002100210 |
4 | 222200102130 |
5 | 10323023200 |
6 | 1034452420 |
7 | 163464561 |
oct | 52402234 |
9 | 22862323 |
10 | 11142300 |
11 | 6320414 |
12 | 3894110 |
13 | 24017a0 |
14 | 16a0868 |
15 | ea1650 |
hex | aa049c |
11142300 has 72 divisors (see below), whose sum is σ = 34730416. Its totient is φ = 2741760.
The previous prime is 11142253. The next prime is 11142311. The reversal of 11142300 is 324111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2472 + ... + 5328.
Almost surely, 211142300 is an apocalyptic number.
11142300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11142300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17365208).
11142300 is an abundant number, since it is smaller than the sum of its proper divisors (23588116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11142300 is a wasteful number, since it uses less digits than its factorization.
11142300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2887 (or 2880 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 11142300 is about 3338.0083882459. The cubic root of 11142300 is about 223.3529103405.
Adding to 11142300 its reverse (324111), we get a palindrome (11466411).
It can be divided in two parts, 11 and 142300, that added together give a triangular number (142311 = T533).
The spelling of 11142300 in words is "eleven million, one hundred forty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •