Base | Representation |
---|---|
bin | 1101010110100… |
… | …10101011101101 |
3 | 21210202210121002 |
4 | 12223102223231 |
5 | 212133341023 |
6 | 15040450045 |
7 | 2530041431 |
oct | 653225355 |
9 | 253683532 |
10 | 112012013 |
11 | 58256313 |
12 | 31619925 |
13 | 1a28b0c9 |
14 | 10c3a9c1 |
15 | 9c78b28 |
hex | 6ad2aed |
112012013 has 4 divisors (see below), whose sum is σ = 112458528. Its totient is φ = 111565500.
The previous prime is 112012009. The next prime is 112012037. The reversal of 112012013 is 310210211.
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: 310210211 = 31 ⋅10006781.
It is a cyclic number.
It is not a de Polignac number, because 112012013 - 22 = 112012009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112011985 and 112012003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112012063) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 222881 + ... + 223382.
It is an arithmetic number, because the mean of its divisors is an integer number (28114632).
Almost surely, 2112012013 is an apocalyptic number.
It is an amenable number.
112012013 is a deficient number, since it is larger than the sum of its proper divisors (446515).
112012013 is an equidigital number, since it uses as much as digits as its factorization.
112012013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 446514.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 112012013 is about 10583.5727899420. The cubic root of 112012013 is about 482.0456861707.
Adding to 112012013 its reverse (310210211), we get a palindrome (422222224).
The spelling of 112012013 in words is "one hundred twelve million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •