Base | Representation |
---|---|
bin | 110100001101011110… |
… | …0011100010101011100 |
3 | 101201101220211012111120 |
4 | 1220122330130111130 |
5 | 3314111011431022 |
6 | 123301402250540 |
7 | 11046316330611 |
oct | 1503274342534 |
9 | 351356735446 |
10 | 112121202012 |
11 | 4360654a626 |
12 | 198911b6a50 |
13 | a75aacc321 |
14 | 55d8bcc508 |
15 | 2db344bd5c |
hex | 1a1af1c55c |
112121202012 has 24 divisors (see below), whose sum is σ = 265904928912. Its totient is φ = 36761049600.
The previous prime is 112121202001. The next prime is 112121202031. The reversal of 112121202012 is 210202121211.
It is a junction number, because it is equal to n+sod(n) for n = 112121201982 and 112121202000.
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 7 ways as a sum of consecutive naturals, for example, 76584789 + ... + 76586252.
It is an arithmetic number, because the mean of its divisors is an integer number (11079372038).
Almost surely, 2112121202012 is an apocalyptic number.
112121202012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112121202012 is an abundant number, since it is smaller than the sum of its proper divisors (153783726900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112121202012 is a wasteful number, since it uses less digits than its factorization.
112121202012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153171109 (or 153171107 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 112121202012 its reverse (210202121211), we get a palindrome (322323323223).
The spelling of 112121202012 in words is "one hundred twelve billion, one hundred twenty-one million, two hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •