Base | Representation |
---|---|
bin | 11001100001000001111101… |
… | …100000100111011011100001 |
3 | 112201100020001012222110220122 |
4 | 121201001331200213123201 |
5 | 104202112112332241001 |
6 | 1034401342034050025 |
7 | 32431462162364516 |
oct | 3141017540473341 |
9 | 481306035873818 |
10 | 112221011212001 |
11 | 3283673326279a |
12 | 10705225719915 |
13 | 4a8051bb93c03 |
14 | 1d9d7511c330d |
15 | ce91d5578b1b |
hex | 66107d8276e1 |
112221011212001 has 2 divisors, whose sum is σ = 112221011212002. Its totient is φ = 112221011212000.
The previous prime is 112221011211979. The next prime is 112221011212003. The reversal of 112221011212001 is 100212110122211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102797191821025 + 9423819390976 = 10138895^2 + 3069824^2 .
It is a cyclic number.
It is not a de Polignac number, because 112221011212001 - 238 = 111946133305057 is a prime.
Together with 112221011212003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (112221011212003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56110505606000 + 56110505606001.
It is an arithmetic number, because the mean of its divisors is an integer number (56110505606001).
Almost surely, 2112221011212001 is an apocalyptic number.
It is an amenable number.
112221011212001 is a deficient number, since it is larger than the sum of its proper divisors (1).
112221011212001 is an equidigital number, since it uses as much as digits as its factorization.
112221011212001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 112221011212001 its reverse (100212110122211), we get a palindrome (212433121334212).
The spelling of 112221011212001 in words is "one hundred twelve trillion, two hundred twenty-one billion, eleven million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •