Base | Representation |
---|---|
bin | 10001110000011010111… |
… | …010010101011111011101 |
3 | 11022122121101100220212112 |
4 | 101300122322111133131 |
5 | 124443003341241221 |
6 | 2332321244443405 |
7 | 154105146445346 |
oct | 21603272253735 |
9 | 4278541326775 |
10 | 1220222212061 |
11 | 43054769a346 |
12 | 1785a1b49565 |
13 | 8b0b3025b68 |
14 | 430b81350cd |
15 | 21b1a1ec15b |
hex | 11c1ae957dd |
1220222212061 has 2 divisors, whose sum is σ = 1220222212062. Its totient is φ = 1220222212060.
The previous prime is 1220222212021. The next prime is 1220222212103. The reversal of 1220222212061 is 1602122220221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1216454584900 + 3767627161 = 1102930^2 + 61381^2 .
It is a cyclic number.
It is not a de Polignac number, because 1220222212061 - 218 = 1220221949917 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 (1220222212021) 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, 610111106030 + 610111106031.
It is an arithmetic number, because the mean of its divisors is an integer number (610111106031).
Almost surely, 21220222212061 is an apocalyptic number.
It is an amenable number.
1220222212061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220222212061 is an equidigital number, since it uses as much as digits as its factorization.
1220222212061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 1220222212061 its reverse (1602122220221), we get a palindrome (2822344432282).
The spelling of 1220222212061 in words is "one trillion, two hundred twenty billion, two hundred twenty-two million, two hundred twelve thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •