Base | Representation |
---|---|
bin | 110100011001010001… |
… | …1001101010100000111 |
3 | 101202102112001000120211 |
4 | 1220302203031110013 |
5 | 3320413403140241 |
6 | 123404550540251 |
7 | 11062165521535 |
oct | 1506243152407 |
9 | 352375030524 |
10 | 112517240071 |
11 | 4379a059905 |
12 | 19981967687 |
13 | a7c1b84482 |
14 | 5635641155 |
15 | 2dd80cb781 |
hex | 1a328cd507 |
112517240071 has 4 divisors (see below), whose sum is σ = 112529609632. Its totient is φ = 112504870512.
The previous prime is 112517240063. The next prime is 112517240081. The reversal of 112517240071 is 170042715211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 170042715211 = 108821 ⋅1562591.
It is a cyclic number.
It is not a de Polignac number, because 112517240071 - 23 = 112517240063 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112517240081) 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 3 ways as a sum of consecutive naturals, for example, 6171126 + ... + 6189331.
It is an arithmetic number, because the mean of its divisors is an integer number (28132402408).
Almost surely, 2112517240071 is an apocalyptic number.
112517240071 is a deficient number, since it is larger than the sum of its proper divisors (12369561).
112517240071 is an equidigital number, since it uses as much as digits as its factorization.
112517240071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12369560.
The product of its (nonzero) digits is 3920, while the sum is 31.
Adding to 112517240071 its reverse (170042715211), we get a palindrome (282559955282).
The spelling of 112517240071 in words is "one hundred twelve billion, five hundred seventeen million, two hundred forty thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •