Base | Representation |
---|---|
bin | 11001011110010001001111… |
… | …011110100000001101110001 |
3 | 112200200002021011020201001011 |
4 | 121132101033132200031301 |
5 | 104141010010122021301 |
6 | 1034134241150310521 |
7 | 32411664032544361 |
oct | 3136211736401561 |
9 | 480602234221034 |
10 | 112031260345201 |
11 | 327732108a800a |
12 | 106944aa4b8441 |
13 | 4a6866c0601c2 |
14 | 1d944b03969a1 |
15 | ce42cbcc4a51 |
hex | 65e44f7a0371 |
112031260345201 has 8 divisors (see below), whose sum is σ = 118624728074184. Its totient is φ = 105438169681920.
The previous prime is 112031260345181. The next prime is 112031260345217. The reversal of 112031260345201 is 102543062130211.
It can be written as a sum of positive squares in 4 ways, for example, as 28991763360000 + 83039496985201 = 5384400^2 + 9112601^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 112031260345201 - 217 = 112031260214129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112031260345001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 93654600 + ... + 94843273.
It is an arithmetic number, because the mean of its divisors is an integer number (14828091009273).
Almost surely, 2112031260345201 is an apocalyptic number.
It is an amenable number.
112031260345201 is a deficient number, since it is larger than the sum of its proper divisors (6593467728983).
112031260345201 is a wasteful number, since it uses less digits than its factorization.
112031260345201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 188532851.
The product of its (nonzero) digits is 8640, while the sum is 31.
The spelling of 112031260345201 in words is "one hundred twelve trillion, thirty-one billion, two hundred sixty million, three hundred forty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •