Base | Representation |
---|---|
bin | 11001011111010010010010… |
… | …111001101100001001111001 |
3 | 112200220202120011121202021021 |
4 | 121133102102321230021321 |
5 | 104143131033410202301 |
6 | 1034230312304542441 |
7 | 32420016014524120 |
oct | 3137222271541171 |
9 | 480822504552237 |
10 | 112101111022201 |
11 | 3279a8a577a544 |
12 | 106a5b43321a21 |
13 | 4a72121584b42 |
14 | 1d97a1921cab7 |
15 | ce601923b8a1 |
hex | 65f492e6c279 |
112101111022201 has 16 divisors (see below), whose sum is σ = 128138203857664. Its totient is φ = 96069681759744.
The previous prime is 112101111022189. The next prime is 112101111022217. The reversal of 112101111022201 is 102220111101211.
It is not a de Polignac number, because 112101111022201 - 27 = 112101111022073 is a prime.
It is a super-3 number, since 3×1121011110222013 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (112101111022291) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1186044721 + ... + 1186139233.
It is an arithmetic number, because the mean of its divisors is an integer number (8008637741104).
Almost surely, 2112101111022201 is an apocalyptic number.
It is an amenable number.
112101111022201 is a deficient number, since it is larger than the sum of its proper divisors (16037092835463).
112101111022201 is an equidigital number, since it uses as much as digits as its factorization.
112101111022201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122680.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 112101111022201 its reverse (102220111101211), we get a palindrome (214321222123412).
The spelling of 112101111022201 in words is "one hundred twelve trillion, one hundred one billion, one hundred eleven million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •