Base | Representation |
---|---|
bin | 11001011101111110010111… |
… | …111011001111010011110001 |
3 | 112200121010222020201101201002 |
4 | 121131332113323033103301 |
5 | 104140142012224014301 |
6 | 1034121050554251345 |
7 | 32410346011140461 |
oct | 3135762773172361 |
9 | 480533866641632 |
10 | 112011001001201 |
11 | 32765664a43005 |
12 | 10690595726b55 |
13 | 4a66790a20aa3 |
14 | 1d9350b881ba1 |
15 | ce39e33cb16b |
hex | 65df97ecf4f1 |
112011001001201 has 2 divisors, whose sum is σ = 112011001001202. Its totient is φ = 112011001001200.
The previous prime is 112011001001153. The next prime is 112011001001213. The reversal of 112011001001201 is 102100100110211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79241615954176 + 32769385047025 = 8901776^2 + 5724455^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112011001001201 is a prime.
It is not a weakly prime, because it can be changed into another prime (112011001601201) 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 as a sum of consecutive naturals, namely, 56005500500600 + 56005500500601.
It is an arithmetic number, because the mean of its divisors is an integer number (56005500500601).
Almost surely, 2112011001001201 is an apocalyptic number.
It is an amenable number.
112011001001201 is a deficient number, since it is larger than the sum of its proper divisors (1).
112011001001201 is an equidigital number, since it uses as much as digits as its factorization.
112011001001201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 112011001001201 its reverse (102100100110211), we get a palindrome (214111101111412).
The spelling of 112011001001201 in words is "one hundred twelve trillion, eleven billion, one million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •