Base | Representation |
---|---|
bin | 1101010110100… |
… | …10111110011101 |
3 | 21210202212020112 |
4 | 12223102332131 |
5 | 212133410323 |
6 | 15040455405 |
7 | 2530045064 |
oct | 653227635 |
9 | 253685215 |
10 | 112013213 |
11 | 58257204 |
12 | 3161a565 |
13 | 1a28b810 |
14 | 10c3b1db |
15 | 9c79178 |
hex | 6ad2f9d |
112013213 has 8 divisors (see below), whose sum is σ = 122431008. Its totient is φ = 101852784.
The previous prime is 112013207. The next prime is 112013233. The reversal of 112013213 is 312310211.
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 112013213 - 26 = 112013149 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 (112013233) 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 7 ways as a sum of consecutive naturals, for example, 63431 + ... + 65172.
It is an arithmetic number, because the mean of its divisors is an integer number (15303876).
Almost surely, 2112013213 is an apocalyptic number.
112013213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
112013213 is a deficient number, since it is larger than the sum of its proper divisors (10417795).
112013213 is a wasteful number, since it uses less digits than its factorization.
112013213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128683.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 112013213 is about 10583.6294814208. The cubic root of 112013213 is about 482.0474075717.
Adding to 112013213 its reverse (312310211), we get a palindrome (424323424).
The spelling of 112013213 in words is "one hundred twelve million, thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •