Base | Representation |
---|---|
bin | 1101010010000… |
… | …00101111101100 |
3 | 21202122102121210 |
4 | 12221000233230 |
5 | 212010224002 |
6 | 15015554420 |
7 | 2522001615 |
oct | 651005754 |
9 | 252572553 |
10 | 111414252 |
11 | 579881a4 |
12 | 3138ba10 |
13 | 1a10bcc1 |
14 | 10b22c0c |
15 | 9bab96c |
hex | 6a40bec |
111414252 has 96 divisors (see below), whose sum is σ = 288046080. Its totient is φ = 33384960.
The previous prime is 111414223. The next prime is 111414263. The reversal of 111414252 is 252414111.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 396352 + ... + 396632.
It is an arithmetic number, because the mean of its divisors is an integer number (3000480).
Almost surely, 2111414252 is an apocalyptic number.
111414252 is a gapful number since it is divisible by the number (12) 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 111414252, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (144023040).
111414252 is an abundant number, since it is smaller than the sum of its proper divisors (176631828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111414252 is a wasteful number, since it uses less digits than its factorization.
111414252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391 (or 389 counting only the distinct ones).
The product of its digits is 320, while the sum is 21.
The square root of 111414252 is about 10555.2949745613. The cubic root of 111414252 is about 481.1866645835.
Adding to 111414252 its reverse (252414111), we get a palindrome (363828363).
The spelling of 111414252 in words is "one hundred eleven million, four hundred fourteen thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •