Base | Representation |
---|---|
bin | 11001011110000111101101… |
… | …001110010110111011011101 |
3 | 112200122002211122000102222220 |
4 | 121132013231032112323131 |
5 | 104140323023113323401 |
6 | 1034125425211255553 |
7 | 32411152232256000 |
oct | 3136075516267335 |
9 | 480562748012886 |
10 | 112021022011101 |
11 | 327699375a8075 |
12 | 1069251174a5b9 |
13 | 4a676c9b86248 |
14 | 1d93bbc713537 |
15 | ce3dcd039336 |
hex | 65e1ed396edd |
112021022011101 has 32 divisors (see below), whose sum is σ = 174949670630400. Its totient is φ = 63730021200048.
The previous prime is 112021022011097. The next prime is 112021022011133. The reversal of 112021022011101 is 101110220120211.
It is a happy number.
It is not a de Polignac number, because 112021022011101 - 22 = 112021022011097 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112021022001101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 239554891 + ... + 240022056.
It is an arithmetic number, because the mean of its divisors is an integer number (5467177207200).
Almost surely, 2112021022011101 is an apocalyptic number.
It is an amenable number.
112021022011101 is a deficient number, since it is larger than the sum of its proper divisors (62928648619299).
112021022011101 is an equidigital number, since it uses as much as digits as its factorization.
112021022011101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479577198 (or 479577184 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 112021022011101 its reverse (101110220120211), we get a palindrome (213131242131312).
The spelling of 112021022011101 in words is "one hundred twelve trillion, twenty-one billion, twenty-two million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •