Base | Representation |
---|---|
bin | 11001101100001011010110… |
… | …101000111010111110110001 |
3 | 112211001110020001020021210212 |
4 | 121230023112220322332301 |
5 | 104302134344222141040 |
6 | 1040145303254233505 |
7 | 32541020312060453 |
oct | 3154132650727661 |
9 | 484043201207725 |
10 | 112987010740145 |
11 | 33001581aa7773 |
12 | 10809781355895 |
13 | 4b07824a20089 |
14 | 1dc8859aa62d3 |
15 | d0e0b8926d65 |
hex | 66c2d6a3afb1 |
112987010740145 has 8 divisors (see below), whose sum is σ = 135584592228456. Its totient is φ = 90389489031936.
The previous prime is 112987010740091. The next prime is 112987010740169. The reversal of 112987010740145 is 541047010789211.
It can be written as a sum of positive squares in 4 ways, for example, as 19789766147761 + 93197244592384 = 4448569^2 + 9653872^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112987010740145 - 26 = 112987010740081 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112987010740093 and 112987010740102.
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, 10676072 + ... + 18437801.
It is an arithmetic number, because the mean of its divisors is an integer number (16948074028557).
Almost surely, 2112987010740145 is an apocalyptic number.
It is an amenable number.
112987010740145 is a deficient number, since it is larger than the sum of its proper divisors (22597581488311).
112987010740145 is an equidigital number, since it uses as much as digits as its factorization.
112987010740145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29890051.
The product of its (nonzero) digits is 564480, while the sum is 50.
The spelling of 112987010740145 in words is "one hundred twelve trillion, nine hundred eighty-seven billion, ten million, seven hundred forty thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •