Base | Representation |
---|---|
bin | 110100001101011100… |
… | …0101111110010011001 |
3 | 101201101211222222102102 |
4 | 1220122320233302121 |
5 | 3314110234424423 |
6 | 123301325413145 |
7 | 11046305154050 |
oct | 1503270576231 |
9 | 351354888372 |
10 | 112120233113 |
11 | 43605a48689 |
12 | 19890a0a1b5 |
13 | a75a850305 |
14 | 55d8a19397 |
15 | 2db3309c28 |
hex | 1a1ae2fc99 |
112120233113 has 4 divisors (see below), whose sum is σ = 128137409280. Its totient is φ = 96103056948.
The previous prime is 112120233097. The next prime is 112120233139. The reversal of 112120233113 is 311332021211.
It is a happy number.
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: 311332021211 = 77573 ⋅4013407.
It is a cyclic number.
It is not a de Polignac number, because 112120233113 - 24 = 112120233097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112120233013) 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, 8008588073 + ... + 8008588086.
It is an arithmetic number, because the mean of its divisors is an integer number (32034352320).
Almost surely, 2112120233113 is an apocalyptic number.
It is an amenable number.
112120233113 is a deficient number, since it is larger than the sum of its proper divisors (16017176167).
112120233113 is an equidigital number, since it uses as much as digits as its factorization.
112120233113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16017176166.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 112120233113 its reverse (311332021211), we get a palindrome (423452254324).
The spelling of 112120233113 in words is "one hundred twelve billion, one hundred twenty million, two hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •