Base | Representation |
---|---|
bin | 11001100111111111100100… |
… | …001100100011001111011001 |
3 | 112210000222001012201022200221 |
4 | 121213333210030203033121 |
5 | 104232432011144000230 |
6 | 1035405231345400041 |
7 | 32511161026563445 |
oct | 3147774414431731 |
9 | 483028035638627 |
10 | 112699475375065 |
11 | 32a00640864147 |
12 | 10781ab6339021 |
13 | 4ab66903a80b7 |
14 | 1db898016d825 |
15 | d0688a6b827a |
hex | 667fe43233d9 |
112699475375065 has 8 divisors (see below), whose sum is σ = 135375838034688. Its totient is φ = 90068601910320.
The previous prime is 112699475375059. The next prime is 112699475375099. The reversal of 112699475375065 is 560573574996211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112699475375065 - 29 = 112699475374553 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112699475374985 and 112699475375003.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11372293267 + ... + 11372303176.
It is an arithmetic number, because the mean of its divisors is an integer number (16921979754336).
Almost surely, 2112699475375065 is an apocalyptic number.
It is an amenable number.
112699475375065 is a deficient number, since it is larger than the sum of its proper divisors (22676362659623).
112699475375065 is an equidigital number, since it uses as much as digits as its factorization.
112699475375065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22744597439.
The product of its (nonzero) digits is 428652000, while the sum is 70.
The spelling of 112699475375065 in words is "one hundred twelve trillion, six hundred ninety-nine billion, four hundred seventy-five million, three hundred seventy-five thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •