Base | Representation |
---|---|
bin | 11011010011101100111110… |
… | …101000001011111010110101 |
3 | 120202020120020121100210010022 |
4 | 123103230332220023322311 |
5 | 111220214300113020041 |
6 | 1103233423410534525 |
7 | 34204012136310656 |
oct | 3323547650137265 |
9 | 522216217323108 |
10 | 120101221220021 |
11 | 352a4707389a58 |
12 | 11578507b97445 |
13 | 520265bc503c2 |
14 | 2192d0438552d |
15 | dd4195bbd24b |
hex | 6d3b3ea0beb5 |
120101221220021 has 2 divisors, whose sum is σ = 120101221220022. Its totient is φ = 120101221220020.
The previous prime is 120101221220009. The next prime is 120101221220063. The reversal of 120101221220021 is 120022122101021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80861207505796 + 39240013714225 = 8992286^2 + 6264185^2 .
It is a cyclic number.
It is not a de Polignac number, because 120101221220021 - 218 = 120101220957877 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 (120101221220921) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60050610610010 + 60050610610011.
It is an arithmetic number, because the mean of its divisors is an integer number (60050610610011).
Almost surely, 2120101221220021 is an apocalyptic number.
It is an amenable number.
120101221220021 is a deficient number, since it is larger than the sum of its proper divisors (1).
120101221220021 is an equidigital number, since it uses as much as digits as its factorization.
120101221220021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 120101221220021 its reverse (120022122101021), we get a palindrome (240123343321042).
The spelling of 120101221220021 in words is "one hundred twenty trillion, one hundred one billion, two hundred twenty-one million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •