Base | Representation |
---|---|
bin | 11001011111010001010000… |
… | …110011011111011111011011 |
3 | 112200220122200212222201122111 |
4 | 121133101100303133133123 |
5 | 104143121301014214321 |
6 | 1034230010252533151 |
7 | 32416646361044245 |
oct | 3137212063373733 |
9 | 480818625881574 |
10 | 112100002101211 |
11 | 3279a386821813 |
12 | 106a5893a811b7 |
13 | 4a71ca58cc787 |
14 | 1d97951c3b095 |
15 | ce5ea1be25e1 |
hex | 65f450cdf7db |
112100002101211 has 2 divisors, whose sum is σ = 112100002101212. Its totient is φ = 112100002101210.
The previous prime is 112100002101179. The next prime is 112100002101313. The reversal of 112100002101211 is 112101200001211.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 112100002101211 - 25 = 112100002101179 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112100002101191 and 112100002101200.
It is not a weakly prime, because it can be changed into another prime (112100002101511) 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 as a sum of consecutive naturals, namely, 56050001050605 + 56050001050606.
It is an arithmetic number, because the mean of its divisors is an integer number (56050001050606).
Almost surely, 2112100002101211 is an apocalyptic number.
112100002101211 is a deficient number, since it is larger than the sum of its proper divisors (1).
112100002101211 is an equidigital number, since it uses as much as digits as its factorization.
112100002101211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 112100002101211 its reverse (112101200001211), we get a palindrome (224201202102422).
The spelling of 112100002101211 in words is "one hundred twelve trillion, one hundred billion, two million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •