Base | Representation |
---|---|
bin | 110100010010110011… |
… | …0100000101101010101 |
3 | 101201212101021012011021 |
4 | 1220211212200231111 |
5 | 3314442300032013 |
6 | 123331230441141 |
7 | 11053620161014 |
oct | 1504546405525 |
9 | 351771235137 |
10 | 112300002133 |
11 | 43698472820 |
12 | 199210631b1 |
13 | a788b73007 |
14 | 5614852a7b |
15 | 2dc3eb9a8d |
hex | 1a259a0b55 |
112300002133 has 8 divisors (see below), whose sum is σ = 122512623840. Its totient is φ = 102087968880.
The previous prime is 112300002119. The next prime is 112300002167. The reversal of 112300002133 is 331200003211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112300002133 is a prime.
It is a super-2 number, since 2×1123000021332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112300102133) 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, 315066 + ... + 569092.
It is an arithmetic number, because the mean of its divisors is an integer number (15314077980).
Almost surely, 2112300002133 is an apocalyptic number.
It is an amenable number.
112300002133 is a deficient number, since it is larger than the sum of its proper divisors (10212621707).
112300002133 is a wasteful number, since it uses less digits than its factorization.
112300002133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294227.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 112300002133 its reverse (331200003211), we get a palindrome (443500005344).
The spelling of 112300002133 in words is "one hundred twelve billion, three hundred million, two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •