Base | Representation |
---|---|
bin | 1101010110100… |
… | …01100000101101 |
3 | 21210202120000022 |
4 | 12223101200231 |
5 | 212133212323 |
6 | 15040411525 |
7 | 2530021433 |
oct | 653214055 |
9 | 253676008 |
10 | 112007213 |
11 | 5825274a |
12 | 31616ba5 |
13 | 1a288b76 |
14 | 10c38d53 |
15 | 9c774c8 |
hex | 6ad182d |
112007213 has 2 divisors, whose sum is σ = 112007214. Its totient is φ = 112007212.
The previous prime is 112007209. The next prime is 112007267. The reversal of 112007213 is 312700211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101163364 + 10843849 = 10058^2 + 3293^2 .
It is an emirp because it is prime and its reverse (312700211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112007213 - 22 = 112007209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112007191 and 112007200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112007113) 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 as a sum of consecutive naturals, namely, 56003606 + 56003607.
It is an arithmetic number, because the mean of its divisors is an integer number (56003607).
Almost surely, 2112007213 is an apocalyptic number.
It is an amenable number.
112007213 is a deficient number, since it is larger than the sum of its proper divisors (1).
112007213 is an equidigital number, since it uses as much as digits as its factorization.
112007213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 17.
The square root of 112007213 is about 10583.3460209898. The cubic root of 112007213 is about 482.0388004440.
Adding to 112007213 its reverse (312700211), we get a palindrome (424707424).
The spelling of 112007213 in words is "one hundred twelve million, seven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •