Base | Representation |
---|---|
bin | 10001100110111111100… |
… | …101111110000110101101 |
3 | 11021200110222001001022121 |
4 | 101212333211332012231 |
5 | 124311241123242031 |
6 | 2323525023112541 |
7 | 153266261042452 |
oct | 21467745760655 |
9 | 4250428031277 |
10 | 1210100212141 |
11 | 427223027a57 |
12 | 176638142751 |
13 | 8a15bc913b2 |
14 | 427d7ad5829 |
15 | 21726791011 |
hex | 119bf97e1ad |
1210100212141 has 2 divisors, whose sum is σ = 1210100212142. Its totient is φ = 1210100212140.
The previous prime is 1210100212063. The next prime is 1210100212151. The reversal of 1210100212141 is 1412120010121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1003753515625 + 206346696516 = 1001875^2 + 454254^2 .
It is a cyclic number.
It is not a de Polignac number, because 1210100212141 - 29 = 1210100211629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1210100212151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605050106070 + 605050106071.
It is an arithmetic number, because the mean of its divisors is an integer number (605050106071).
Almost surely, 21210100212141 is an apocalyptic number.
It is an amenable number.
1210100212141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1210100212141 is an equidigital number, since it uses as much as digits as its factorization.
1210100212141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1210100212141 its reverse (1412120010121), we get a palindrome (2622220222262).
It can be divided in two parts, 1210100 and 212141, that added together give a palindrome (1422241).
The spelling of 1210100212141 in words is "one trillion, two hundred ten billion, one hundred million, two hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •