Base | Representation |
---|---|
bin | 11101000111110001011… |
… | …010010100011100111011 |
3 | 21002022110202200021120202 |
4 | 131013301122110130323 |
5 | 230241434230014321 |
6 | 4131202043312415 |
7 | 264403564226261 |
oct | 35076132243473 |
9 | 7068422607522 |
10 | 2001210001211 |
11 | 701787968693 |
12 | 283a2121b70b |
13 | 11693714ab15 |
14 | 6cc05464431 |
15 | 370c934170b |
hex | 1d1f169473b |
2001210001211 has 4 divisors (see below), whose sum is σ = 2106536843400. Its totient is φ = 1895883159024.
The previous prime is 2001210001207. The next prime is 2001210001237. The reversal of 2001210001211 is 1121000121002.
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 2001210001211 - 22 = 2001210001207 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2001210001192 and 2001210001201.
It is not an unprimeable number, because it can be changed into a prime (2001210001811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52663421066 + ... + 52663421103.
It is an arithmetic number, because the mean of its divisors is an integer number (526634210850).
Almost surely, 22001210001211 is an apocalyptic number.
2001210001211 is a deficient number, since it is larger than the sum of its proper divisors (105326842189).
2001210001211 is a wasteful number, since it uses less digits than its factorization.
2001210001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105326842188.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2001210001211 its reverse (1121000121002), we get a palindrome (3122210122213).
The spelling of 2001210001211 in words is "two trillion, one billion, two hundred ten million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •