Base | Representation |
---|---|
bin | 11001100000111001101010… |
… | …010111110110000101000011 |
3 | 112201022101001012100201120221 |
4 | 121200321222113312011003 |
5 | 104201440340123223021 |
6 | 1034353305512243511 |
7 | 32431025310210013 |
oct | 3140715227660503 |
9 | 481271035321527 |
10 | 112212100211011 |
11 | 32832980229869 |
12 | 107035593a0597 |
13 | 4a7c72b9a5068 |
14 | 1d9d147937c43 |
15 | ce8d630cc241 |
hex | 660e6a5f6143 |
112212100211011 has 4 divisors (see below), whose sum is σ = 112215318166224. Its totient is φ = 112208882255800.
The previous prime is 112212100210961. The next prime is 112212100211027. The reversal of 112212100211011 is 110112001212211.
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-112212100211011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112212100211041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1608925300 + ... + 1608995041.
It is an arithmetic number, because the mean of its divisors is an integer number (28053829541556).
Almost surely, 2112212100211011 is an apocalyptic number.
112212100211011 is a deficient number, since it is larger than the sum of its proper divisors (3217955213).
112212100211011 is an equidigital number, since it uses as much as digits as its factorization.
112212100211011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3217955212.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 112212100211011 its reverse (110112001212211), we get a palindrome (222324101423222).
The spelling of 112212100211011 in words is "one hundred twelve trillion, two hundred twelve billion, one hundred million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.206 sec. • engine limits •