Base | Representation |
---|---|
bin | 1101011000000… |
… | …00111000011001 |
3 | 21211010102011112 |
4 | 12230000320121 |
5 | 212210414431 |
6 | 15044510105 |
7 | 2531460215 |
oct | 654007031 |
9 | 254112145 |
10 | 112201241 |
11 | 583754a9 |
12 | 316ab335 |
13 | 1a326289 |
14 | 10c89945 |
15 | 9cb4c2b |
hex | 6b00e19 |
112201241 has 8 divisors (see below), whose sum is σ = 118989000. Its totient is φ = 105434368.
The previous prime is 112201223. The next prime is 112201247. The reversal of 112201241 is 142102211.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 46185616 + 66015625 = 6796^2 + 8125^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112201241 - 222 = 108006937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112201247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6635 + ... + 16383.
It is an arithmetic number, because the mean of its divisors is an integer number (14873625).
Almost surely, 2112201241 is an apocalyptic number.
It is an amenable number.
112201241 is a deficient number, since it is larger than the sum of its proper divisors (6787759).
112201241 is an equidigital number, since it uses as much as digits as its factorization.
112201241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10443.
The product of its (nonzero) digits is 32, while the sum is 14.
The square root of 112201241 is about 10592.5087207894. The cubic root of 112201241 is about 482.3169821419.
Adding to 112201241 its reverse (142102211), we get a palindrome (254303452).
The spelling of 112201241 in words is "one hundred twelve million, two hundred one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •