Base | Representation |
---|---|
bin | 11001100101111110011010… |
… | …111011001101100100101111 |
3 | 112202112201010011222002111022 |
4 | 121211332122323031210233 |
5 | 104223144013111432011 |
6 | 1035221415420044355 |
7 | 32465151506202614 |
oct | 3145763273154457 |
9 | 482481104862438 |
10 | 112560807139631 |
11 | 329578521a3484 |
12 | 1075b0566936bb |
13 | 4aa65916c3296 |
14 | 1db1d8777050b |
15 | d02e7185d8db |
hex | 665f9aecd92f |
112560807139631 has 16 divisors (see below), whose sum is σ = 121380414140160. Its totient is φ = 104030970160320.
The previous prime is 112560807139609. The next prime is 112560807139643. The reversal of 112560807139631 is 136931708065211.
It is a cyclic number.
It is not a de Polignac number, because 112560807139631 - 234 = 112543627270447 is a prime.
It is a super-2 number, since 2×1125608071396312 (a number of 29 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 (112560807139031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14082920 + ... + 20577906.
It is an arithmetic number, because the mean of its divisors is an integer number (7586275883760).
Almost surely, 2112560807139631 is an apocalyptic number.
112560807139631 is a deficient number, since it is larger than the sum of its proper divisors (8819607000529).
112560807139631 is a wasteful number, since it uses less digits than its factorization.
112560807139631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6517294.
The product of its (nonzero) digits is 1632960, while the sum is 53.
The spelling of 112560807139631 in words is "one hundred twelve trillion, five hundred sixty billion, eight hundred seven million, one hundred thirty-nine thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •