Base | Representation |
---|---|
bin | 11001011111001110100001… |
… | …001101110100001111010100 |
3 | 112200220101002120210001020212 |
4 | 121133032201031310033110 |
5 | 104143044232342240144 |
6 | 1034224402100144552 |
7 | 32416513360306610 |
oct | 3137164115641724 |
9 | 480811076701225 |
10 | 112097056211924 |
11 | 3279910495a573 |
12 | 106a51b1398158 |
13 | 4a719264b2714 |
14 | 1d977528bc340 |
15 | ce5d7d28b49e |
hex | 65f3a13743d4 |
112097056211924 has 12 divisors (see below), whose sum is σ = 224194112423904. Its totient is φ = 48041595519384.
The previous prime is 112097056211911. The next prime is 112097056211947. The reversal of 112097056211924 is 429112650790211.
112097056211924 is an admirable number.
It is a super-2 number, since 2×1120970562119242 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2001733146614 + ... + 2001733146669.
It is an arithmetic number, because the mean of its divisors is an integer number (18682842701992).
Almost surely, 2112097056211924 is an apocalyptic number.
112097056211924 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
112097056211924 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112097056211924 is a wasteful number, since it uses less digits than its factorization.
112097056211924 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4003466293294 (or 4003466293292 counting only the distinct ones).
The product of its (nonzero) digits is 544320, while the sum is 50.
The spelling of 112097056211924 in words is "one hundred twelve trillion, ninety-seven billion, fifty-six million, two hundred eleven thousand, nine hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •