Base | Representation |
---|---|
bin | 11001011101110101001111… |
… | …110111011001111111000011 |
3 | 112200120012200100100202022021 |
4 | 121131311033313121333003 |
5 | 104140011430214232321 |
6 | 1034112350354022311 |
7 | 32406551124650032 |
oct | 3135651767317703 |
9 | 480505610322267 |
10 | 112001202102211 |
11 | 327614967a3184 |
12 | 1068a6bbb77997 |
13 | 4a6588b8b4ac6 |
14 | 1d92c5c30a719 |
15 | ce361cee3941 |
hex | 65dd4fdd9fc3 |
112001202102211 has 4 divisors (see below), whose sum is σ = 112002035473512. Its totient is φ = 112000368730912.
The previous prime is 112001202102161. The next prime is 112001202102227. The reversal of 112001202102211 is 112201202100211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112001202102211 - 221 = 112001200005059 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112001202102271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 416484025 + ... + 416752858.
It is an arithmetic number, because the mean of its divisors is an integer number (28000508868378).
Almost surely, 2112001202102211 is an apocalyptic number.
112001202102211 is a deficient number, since it is larger than the sum of its proper divisors (833371301).
112001202102211 is an equidigital number, since it uses as much as digits as its factorization.
112001202102211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 833371300.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 112001202102211 its reverse (112201202100211), we get a palindrome (224202404202422).
The spelling of 112001202102211 in words is "one hundred twelve trillion, one billion, two hundred two million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •