Base | Representation |
---|---|
bin | 10001100111000101100… |
… | …010101101100101011101 |
3 | 11021200201220211212210122 |
4 | 101213011202231211131 |
5 | 124311442201140331 |
6 | 2323542550244325 |
7 | 153301612311413 |
oct | 21470542554535 |
9 | 4250656755718 |
10 | 1210200021341 |
11 | 4272743a90a3 |
12 | 1766656566a5 |
13 | 8a1768690ac |
14 | 428070772b3 |
15 | 2173040917b |
hex | 119c58ad95d |
1210200021341 has 2 divisors, whose sum is σ = 1210200021342. Its totient is φ = 1210200021340.
The previous prime is 1210200021319. The next prime is 1210200021343. The reversal of 1210200021341 is 1431200020121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1028855205625 + 181344815716 = 1014325^2 + 425846^2 .
It is an emirp because it is prime and its reverse (1431200020121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1210200021341 - 226 = 1210132912477 is a prime.
Together with 1210200021343, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1210200021343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605100010670 + 605100010671.
It is an arithmetic number, because the mean of its divisors is an integer number (605100010671).
Almost surely, 21210200021341 is an apocalyptic number.
It is an amenable number.
1210200021341 is a deficient number, since it is larger than the sum of its proper divisors (1).
1210200021341 is an equidigital number, since it uses as much as digits as its factorization.
1210200021341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 1210200021341 its reverse (1431200020121), we get a palindrome (2641400041462).
The spelling of 1210200021341 in words is "one trillion, two hundred ten billion, two hundred million, twenty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •