Base | Representation |
---|---|
bin | 10001100111000110001… |
… | …001100010100111001011 |
3 | 11021200202122000000022102 |
4 | 101213012021202213023 |
5 | 124312002302400021 |
6 | 2323543552344015 |
7 | 153302064654011 |
oct | 21470611424713 |
9 | 4250678000272 |
10 | 1210210200011 |
11 | 42727a12051a |
12 | 176668b4500b |
13 | 8a1789c1087 |
14 | 428085668b1 |
15 | 2173126a00b |
hex | 119c62629cb |
1210210200011 has 8 divisors (see below), whose sum is σ = 1217948354304. Its totient is φ = 1202472423360.
The previous prime is 1210210199999. The next prime is 1210210200013. The reversal of 1210210200011 is 1100020120121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1210210200011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1210210199965 and 1210210200001.
It is not an unprimeable number, because it can be changed into a prime (1210210200013) 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 in 7 ways as a sum of consecutive naturals, for example, 9329366 + ... + 9458196.
It is an arithmetic number, because the mean of its divisors is an integer number (152243544288).
Almost surely, 21210210200011 is an apocalyptic number.
1210210200011 is a deficient number, since it is larger than the sum of its proper divisors (7738154293).
1210210200011 is a wasteful number, since it uses less digits than its factorization.
1210210200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188821.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1210210200011 its reverse (1100020120121), we get a palindrome (2310230320132).
The spelling of 1210210200011 in words is "one trillion, two hundred ten billion, two hundred ten million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •