Base | Representation |
---|---|
bin | 11001011111010001010001… |
… | …111011101000011011110011 |
3 | 112200220122202012120111122220 |
4 | 121133101101323220123303 |
5 | 104143121320334342321 |
6 | 1034230012210132123 |
7 | 32416650010556331 |
oct | 3137212173503363 |
9 | 480818665514586 |
10 | 112100021012211 |
11 | 3279a396468941 |
12 | 106a589a281043 |
13 | 4a71ca97c130b |
14 | 1d97954560b51 |
15 | ce5ea36ca9c6 |
hex | 65f451ee86f3 |
112100021012211 has 4 divisors (see below), whose sum is σ = 149466694682952. Its totient is φ = 74733347341472.
The previous prime is 112100021012137. The next prime is 112100021012261. The reversal of 112100021012211 is 112210120001211.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112100021012211 is a prime.
It is a super-2 number, since 2×1121000210122112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112100021012261) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18683336835366 + ... + 18683336835371.
It is an arithmetic number, because the mean of its divisors is an integer number (37366673670738).
Almost surely, 2112100021012211 is an apocalyptic number.
112100021012211 is a deficient number, since it is larger than the sum of its proper divisors (37366673670741).
112100021012211 is an equidigital number, since it uses as much as digits as its factorization.
112100021012211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37366673670740.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 112100021012211 its reverse (112210120001211), we get a palindrome (224310141013422).
The spelling of 112100021012211 in words is "one hundred twelve trillion, one hundred billion, twenty-one million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •