Base | Representation |
---|---|
bin | 1101011011011… |
… | …11011100101001 |
3 | 21211222102101212 |
4 | 12231233130221 |
5 | 212314412441 |
6 | 15102322505 |
7 | 2535354446 |
oct | 655573451 |
9 | 254872355 |
10 | 112654121 |
11 | 58654788 |
12 | 31889435 |
13 | 1a454458 |
14 | 10d669cd |
15 | 9d53eeb |
hex | 6b6f729 |
112654121 has 4 divisors (see below), whose sum is σ = 119280852. Its totient is φ = 106027392.
The previous prime is 112654117. The next prime is 112654147. The reversal of 112654121 is 121456211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 121456211 = 17 ⋅7144483.
It can be written as a sum of positive squares in 2 ways, for example, as 45414121 + 67240000 = 6739^2 + 8200^2 .
It is a cyclic number.
It is not a de Polignac number, because 112654121 - 22 = 112654117 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112654181) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 3313340 + ... + 3313373.
It is an arithmetic number, because the mean of its divisors is an integer number (29820213).
Almost surely, 2112654121 is an apocalyptic number.
It is an amenable number.
112654121 is a deficient number, since it is larger than the sum of its proper divisors (6626731).
112654121 is an equidigital number, since it uses as much as digits as its factorization.
112654121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6626730.
The product of its digits is 480, while the sum is 23.
The square root of 112654121 is about 10613.8645648039. The cubic root of 112654121 is about 482.9650393989.
The spelling of 112654121 in words is "one hundred twelve million, six hundred fifty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •