Base | Representation |
---|---|
bin | 11001011111110110010101… |
… | …101100100010010111100000 |
3 | 112201001110110100111012012110 |
4 | 121133312111230202113200 |
5 | 104144244314012032202 |
6 | 1034300152502155320 |
7 | 32422556044564125 |
oct | 3137662554422740 |
9 | 481043410435173 |
10 | 112139812611552 |
11 | 32805255816430 |
12 | 106b1544422b40 |
13 | 4a7597b63797b |
14 | 1d9984b1a074c |
15 | ce7031c4926c |
hex | 65fd95b225e0 |
112139812611552 has 144 divisors (see below), whose sum is σ = 338918651632512. Its totient is φ = 32193247530240.
The previous prime is 112139812611521. The next prime is 112139812611553. The reversal of 112139812611552 is 255116218931211.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112139812611553) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 146700508 + ... + 147462939.
It is an arithmetic number, because the mean of its divisors is an integer number (2353601747448).
Almost surely, 2112139812611552 is an apocalyptic number.
112139812611552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112139812611552 is an abundant number, since it is smaller than the sum of its proper divisors (226778839020960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112139812611552 is a wasteful number, since it uses less digits than its factorization.
112139812611552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294163509 (or 294163482 counting only the distinct ones).
The product of its digits is 259200, while the sum is 48.
The spelling of 112139812611552 in words is "one hundred twelve trillion, one hundred thirty-nine billion, eight hundred twelve million, six hundred eleven thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •