Base | Representation |
---|---|
bin | 10001100111000101100… |
… | …011011001011111111011 |
3 | 11021200201221012000112111 |
4 | 101213011203121133323 |
5 | 124311442222414321 |
6 | 2323542554153151 |
7 | 153301613661001 |
oct | 21470543313773 |
9 | 4250657160474 |
10 | 1210200201211 |
11 | 427274511251 |
12 | 1766657227b7 |
13 | 8a1768ccc21 |
14 | 428070c2a71 |
15 | 217304425e1 |
hex | 119c58d97fb |
1210200201211 has 4 divisors (see below), whose sum is σ = 1210285723752. Its totient is φ = 1210114678672.
The previous prime is 1210200201187. The next prime is 1210200201263. The reversal of 1210200201211 is 1121020020121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1210200201211 - 211 = 1210200199163 is a prime.
It is a super-2 number, since 2×12102002012112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1210200201191 and 1210200201200.
It is not an unprimeable number, because it can be changed into a prime (1210200201271) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42740041 + ... + 42768346.
It is an arithmetic number, because the mean of its divisors is an integer number (302571430938).
Almost surely, 21210200201211 is an apocalyptic number.
1210200201211 is a deficient number, since it is larger than the sum of its proper divisors (85522541).
1210200201211 is an equidigital number, since it uses as much as digits as its factorization.
1210200201211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85522540.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1210200201211 its reverse (1121020020121), we get a palindrome (2331220221332).
The spelling of 1210200201211 in words is "one trillion, two hundred ten billion, two hundred million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •