Base | Representation |
---|---|
bin | 1101010110100… |
… | …00010001001001 |
3 | 21210202022000201 |
4 | 12223100101021 |
5 | 212133031441 |
6 | 15040332201 |
7 | 2530000540 |
oct | 653202111 |
9 | 253668021 |
10 | 112002121 |
11 | 58249940 |
12 | 31614061 |
13 | 1a28675a |
14 | 10c37157 |
15 | 9c75c31 |
hex | 6ad0449 |
112002121 has 8 divisors (see below), whose sum is σ = 139639104. Its totient is φ = 87274320.
The previous prime is 112002067. The next prime is 112002151. The reversal of 112002121 is 121200211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112002121 - 29 = 112001609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112002098 and 112002107.
It is not an unprimeable number, because it can be changed into a prime (112002151) 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, 727210 + ... + 727363.
It is an arithmetic number, because the mean of its divisors is an integer number (17454888).
Almost surely, 2112002121 is an apocalyptic number.
112002121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112002121 is a deficient number, since it is larger than the sum of its proper divisors (27636983).
112002121 is a wasteful number, since it uses less digits than its factorization.
112002121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1454591.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 112002121 is about 10583.1054516149. The cubic root of 112002121 is about 482.0314956204.
Adding to 112002121 its reverse (121200211), we get a palindrome (233202332).
The spelling of 112002121 in words is "one hundred twelve million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •