Base | Representation |
---|---|
bin | 110100001101001110… |
… | …1111011001101110001 |
3 | 101201101100202202121001 |
4 | 1220122131323031301 |
5 | 3314101434431113 |
6 | 123300515002001 |
7 | 11046161331220 |
oct | 1503235731561 |
9 | 351340682531 |
10 | 112113202033 |
11 | 43601a86078 |
12 | 1988a599301 |
13 | a75925ac01 |
14 | 55d7b08cb7 |
15 | 2db28bb7dd |
hex | 1a1a77b371 |
112113202033 has 4 divisors (see below), whose sum is σ = 128129373760. Its totient is φ = 96097030308.
The previous prime is 112113202031. The next prime is 112113202073. The reversal of 112113202033 is 330202311211.
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.
It is a cyclic number.
It is not a de Polignac number, because 112113202033 - 21 = 112113202031 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112113202033.
It is not an unprimeable number, because it can be changed into a prime (112113202031) 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, 8008085853 + ... + 8008085866.
It is an arithmetic number, because the mean of its divisors is an integer number (32032343440).
Almost surely, 2112113202033 is an apocalyptic number.
It is an amenable number.
112113202033 is a deficient number, since it is larger than the sum of its proper divisors (16016171727).
112113202033 is an equidigital number, since it uses as much as digits as its factorization.
112113202033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16016171726.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 112113202033 its reverse (330202311211), we get a palindrome (442315513244).
The spelling of 112113202033 in words is "one hundred twelve billion, one hundred thirteen million, two hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •