Base | Representation |
---|---|
bin | 11011010011110101010111… |
… | …001100110101001101101001 |
3 | 120202021102110222120121212121 |
4 | 123103311113030311031221 |
5 | 111220341214143222441 |
6 | 1103241512551111241 |
7 | 34204451206560553 |
oct | 3323652714651551 |
9 | 522242428517777 |
10 | 120110223414121 |
11 | 352a8506939696 |
12 | 1157a1ba972521 |
13 | 5203464cbb285 |
14 | 2193519bac4d3 |
15 | dd452117edd1 |
hex | 6d3d57335369 |
120110223414121 has 2 divisors, whose sum is σ = 120110223414122. Its totient is φ = 120110223414120.
The previous prime is 120110223414119. The next prime is 120110223414149. The reversal of 120110223414121 is 121414322011021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 118902886147600 + 1207337266521 = 10904260^2 + 1098789^2 .
It is a cyclic number.
It is not a de Polignac number, because 120110223414121 - 21 = 120110223414119 is a prime.
Together with 120110223414119, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (120110223414151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60055111707060 + 60055111707061.
It is an arithmetic number, because the mean of its divisors is an integer number (60055111707061).
Almost surely, 2120110223414121 is an apocalyptic number.
It is an amenable number.
120110223414121 is a deficient number, since it is larger than the sum of its proper divisors (1).
120110223414121 is an equidigital number, since it uses as much as digits as its factorization.
120110223414121 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 25.
Adding to 120110223414121 its reverse (121414322011021), we get a palindrome (241524545425142).
The spelling of 120110223414121 in words is "one hundred twenty trillion, one hundred ten billion, two hundred twenty-three million, four hundred fourteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •