Base | Representation |
---|---|
bin | 1101011111110… |
… | …10100111001100 |
3 | 21220001101022200 |
4 | 12233322213030 |
5 | 212441133030 |
6 | 15122441500 |
7 | 2543250351 |
oct | 657724714 |
9 | 256041280 |
10 | 113224140 |
11 | 58a03a77 |
12 | 31b03290 |
13 | 1a5c3a43 |
14 | 11074628 |
15 | 9e17d60 |
hex | 6bfa9cc |
113224140 has 36 divisors (see below), whose sum is σ = 343447104. Its totient is φ = 30193056.
The previous prime is 113224129. The next prime is 113224151. The reversal of 113224140 is 41422311.
It is an interprime number because it is at equal distance from previous prime (113224129) and next prime (113224151).
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 314332 + ... + 314691.
Almost surely, 2113224140 is an apocalyptic number.
113224140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113224140 is an abundant number, since it is smaller than the sum of its proper divisors (230222964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113224140 is a wasteful number, since it uses less digits than its factorization.
113224140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 629038 (or 629033 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
The square root of 113224140 is about 10640.6832487392. The cubic root of 113224140 is about 483.7782548647.
Adding to 113224140 its reverse (41422311), we get a palindrome (154646451).
The spelling of 113224140 in words is "one hundred thirteen million, two hundred twenty-four thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •