Base | Representation |
---|---|
bin | 10001100111000000001… |
… | …011010110011101001101 |
3 | 11021200111122110220010012 |
4 | 101213000023112131031 |
5 | 124311301130324323 |
6 | 2323530013123005 |
7 | 153266440244255 |
oct | 21470013263515 |
9 | 4250448426105 |
10 | 1210110011213 |
11 | 427228610164 |
12 | 17663b489465 |
13 | 8a16101266c |
14 | 427d9126965 |
15 | 21727579678 |
hex | 119c02d674d |
1210110011213 has 2 divisors, whose sum is σ = 1210110011214. Its totient is φ = 1210110011212.
The previous prime is 1210110011183. The next prime is 1210110011249. The reversal of 1210110011213 is 3121100110121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1044439032484 + 165670978729 = 1021978^2 + 407027^2 .
It is a cyclic number.
It is not a de Polignac number, because 1210110011213 - 210 = 1210110010189 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 (1210110011293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605055005606 + 605055005607.
It is an arithmetic number, because the mean of its divisors is an integer number (605055005607).
Almost surely, 21210110011213 is an apocalyptic number.
It is an amenable number.
1210110011213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1210110011213 is an equidigital number, since it uses as much as digits as its factorization.
1210110011213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1210110011213 its reverse (3121100110121), we get a palindrome (4331210121334).
The spelling of 1210110011213 in words is "one trillion, two hundred ten billion, one hundred ten million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •