Base | Representation |
---|---|
bin | 11001011110001000101110… |
… | …110011010010001011010001 |
3 | 112200122012200022020100011022 |
4 | 121132020232303102023101 |
5 | 104140332301241210001 |
6 | 1034130130312325225 |
7 | 32411221421640653 |
oct | 3136105663221321 |
9 | 480565608210138 |
10 | 112022122210001 |
11 | 3276a351638863 |
12 | 1069277a0a3815 |
13 | 4a67843aa6603 |
14 | 1d93c848a46d3 |
15 | ce3e4490e11b |
hex | 65e22ecd22d1 |
112022122210001 has 2 divisors, whose sum is σ = 112022122210002. Its totient is φ = 112022122210000.
The previous prime is 112022122209989. The next prime is 112022122210051. The reversal of 112022122210001 is 100012221220211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 89095646024401 + 22926476185600 = 9439049^2 + 4788160^2 .
It is a cyclic number.
It is not a de Polignac number, because 112022122210001 - 26 = 112022122209937 is a prime.
It is not a weakly prime, because it can be changed into another prime (112022122210051) 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 as a sum of consecutive naturals, namely, 56011061105000 + 56011061105001.
It is an arithmetic number, because the mean of its divisors is an integer number (56011061105001).
Almost surely, 2112022122210001 is an apocalyptic number.
It is an amenable number.
112022122210001 is a deficient number, since it is larger than the sum of its proper divisors (1).
112022122210001 is an equidigital number, since it uses as much as digits as its factorization.
112022122210001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 112022122210001 its reverse (100012221220211), we get a palindrome (212034343430212).
The spelling of 112022122210001 in words is "one hundred twelve trillion, twenty-two billion, one hundred twenty-two million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •