Base | Representation |
---|---|
bin | 10001110000001110011… |
… | …001010010001010000101 |
3 | 11022122001202020021101002 |
4 | 101300032121102022011 |
5 | 124442041112033221 |
6 | 2332244343543045 |
7 | 154100016526604 |
oct | 21601631221205 |
9 | 4278052207332 |
10 | 1220012221061 |
11 | 43044a102a67 |
12 | 17854375aa85 |
13 | 8b07b68112a |
14 | 430982b1a3b |
15 | 21b06a6c80b |
hex | 11c0e652285 |
1220012221061 has 2 divisors, whose sum is σ = 1220012221062. Its totient is φ = 1220012221060.
The previous prime is 1220012221003. The next prime is 1220012221079. The reversal of 1220012221061 is 1601222100221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1192747936900 + 27264284161 = 1092130^2 + 165119^2 .
It is an emirp because it is prime and its reverse (1601222100221) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1220012221061 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1220012226061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610006110530 + 610006110531.
It is an arithmetic number, because the mean of its divisors is an integer number (610006110531).
Almost surely, 21220012221061 is an apocalyptic number.
It is an amenable number.
1220012221061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220012221061 is an equidigital number, since it uses as much as digits as its factorization.
1220012221061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 1220012221061 its reverse (1601222100221), we get a palindrome (2821234321282).
The spelling of 1220012221061 in words is "one trillion, two hundred twenty billion, twelve million, two hundred twenty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •