Base | Representation |
---|---|
bin | 11001100001001100110011… |
… | …010000110000100000000011 |
3 | 112201101100002101020122220011 |
4 | 121201030303100300200003 |
5 | 104202304432003132010 |
6 | 1034410545015125351 |
7 | 32432353463252053 |
oct | 3141146320604003 |
9 | 481340071218804 |
10 | 112232650442755 |
11 | 32840666304067 |
12 | 10707533673857 |
13 | 4a816553717bb |
14 | 1da0136d2d563 |
15 | ce96672d4a8a |
hex | 661333430803 |
112232650442755 has 8 divisors (see below), whose sum is σ = 136887035950224. Its totient is φ = 88314216741600.
The previous prime is 112232650442723. The next prime is 112232650442789. The reversal of 112232650442755 is 557244056232211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112232650442755 - 25 = 112232650442723 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112232650442699 and 112232650442708.
It is an unprimeable number.
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, 183987951241 + ... + 183987951850.
It is an arithmetic number, because the mean of its divisors is an integer number (17110879493778).
Almost surely, 2112232650442755 is an apocalyptic number.
112232650442755 is a deficient number, since it is larger than the sum of its proper divisors (24654385507469).
112232650442755 is an equidigital number, since it uses as much as digits as its factorization.
112232650442755 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 367975903157.
The product of its (nonzero) digits is 4032000, while the sum is 49.
The spelling of 112232650442755 in words is "one hundred twelve trillion, two hundred thirty-two billion, six hundred fifty million, four hundred forty-two thousand, seven hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •