Base | Representation |
---|---|
bin | 110100010111001000… |
… | …0100100011110001101 |
3 | 101202020111120022100202 |
4 | 1220232100210132031 |
5 | 3320241440322300 |
6 | 123353455503245 |
7 | 11060332546400 |
oct | 1505620443615 |
9 | 352214508322 |
10 | 112445245325 |
11 | 43762456116 |
12 | 19961827b25 |
13 | a7acc97a2a |
14 | 5629c5dd37 |
15 | 2dd1b09ad5 |
hex | 1a2e42478d |
112445245325 has 36 divisors (see below), whose sum is σ = 162325801332. Its totient is φ = 77043859200.
The previous prime is 112445245321. The next prime is 112445245331. The reversal of 112445245325 is 523542544211.
It can be written as a sum of positive squares in 6 ways, for example, as 19182804004 + 93262441321 = 138502^2 + 305389^2 .
It is not a de Polignac number, because 112445245325 - 22 = 112445245321 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 (112445245321) 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 35 ways as a sum of consecutive naturals, for example, 1528385 + ... + 1600265.
It is an arithmetic number, because the mean of its divisors is an integer number (4509050037).
Almost surely, 2112445245325 is an apocalyptic number.
It is an amenable number.
112445245325 is a deficient number, since it is larger than the sum of its proper divisors (49880556007).
112445245325 is a wasteful number, since it uses less digits than its factorization.
112445245325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73182 (or 73170 counting only the distinct ones).
The product of its digits is 192000, while the sum is 38.
Adding to 112445245325 its reverse (523542544211), we get a palindrome (635987789536).
The spelling of 112445245325 in words is "one hundred twelve billion, four hundred forty-five million, two hundred forty-five thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •