Base | Representation |
---|---|
bin | 110100001110100000… |
… | …1111111011111000000 |
3 | 101201111100200211222210 |
4 | 1220131001333133000 |
5 | 3314143442224021 |
6 | 123305052502120 |
7 | 11050223031204 |
oct | 1503501773700 |
9 | 351440624883 |
10 | 112156211136 |
11 | 43624291492 |
12 | 198a0a7a940 |
13 | a765139298 |
14 | 55dd702b04 |
15 | 2db6564e76 |
hex | 1a1d07f7c0 |
112156211136 has 112 divisors (see below), whose sum is σ = 300837892608. Its totient is φ = 36872832000.
The previous prime is 112156211119. The next prime is 112156211143. The reversal of 112156211136 is 631112651211.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5089101 + ... + 5111091.
Almost surely, 2112156211136 is an apocalyptic number.
112156211136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 112156211136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150418946304).
112156211136 is an abundant number, since it is smaller than the sum of its proper divisors (188681681472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112156211136 is a wasteful number, since it uses less digits than its factorization.
112156211136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22370 (or 22360 counting only the distinct ones).
The product of its digits is 2160, while the sum is 30.
Adding to 112156211136 its reverse (631112651211), we get a palindrome (743268862347).
The spelling of 112156211136 in words is "one hundred twelve billion, one hundred fifty-six million, two hundred eleven thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •