Base | Representation |
---|---|
bin | 1101011010000… |
… | …01000101011101 |
3 | 21211121202220112 |
4 | 12231001011131 |
5 | 212242323341 |
6 | 15054255405 |
7 | 2533634012 |
oct | 655010535 |
9 | 254552815 |
10 | 112464221 |
11 | 58535041 |
12 | 317b7565 |
13 | 1a3b8b9c |
14 | 10d17709 |
15 | 9d17aeb |
hex | 6b4115d |
112464221 has 4 divisors (see below), whose sum is σ = 115079712. Its totient is φ = 109848732.
The previous prime is 112464161. The next prime is 112464223. The reversal of 112464221 is 122464211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 122464211 = 577 ⋅212243.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112464221 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112464223) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 1307681 + ... + 1307766.
It is an arithmetic number, because the mean of its divisors is an integer number (28769928).
Almost surely, 2112464221 is an apocalyptic number.
It is an amenable number.
112464221 is a deficient number, since it is larger than the sum of its proper divisors (2615491).
112464221 is an equidigital number, since it uses as much as digits as its factorization.
112464221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2615490.
The product of its digits is 768, while the sum is 23.
The square root of 112464221 is about 10604.9149454392. The cubic root of 112464221 is about 482.6935102177.
The spelling of 112464221 in words is "one hundred twelve million, four hundred sixty-four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •