Base | Representation |
---|---|
bin | 11101010000001001010… |
… | …000110111100001101011 |
3 | 21010011200022011012001210 |
4 | 131100021100313201223 |
5 | 230413342212024321 |
6 | 4135250112444203 |
7 | 265142430006435 |
oct | 35201120674153 |
9 | 7104608135053 |
10 | 2010200111211 |
11 | 705580614366 |
12 | 28570bb49663 |
13 | 11773a847636 |
14 | 6d419423655 |
15 | 37453717b76 |
hex | 1d40943786b |
2010200111211 has 8 divisors (see below), whose sum is σ = 2686485533184. Its totient is φ = 1337024048360.
The previous prime is 2010200111203. The next prime is 2010200111221. The reversal of 2010200111211 is 1121110020102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2010200111211 - 23 = 2010200111203 is a prime.
It is a super-2 number, since 2×20102001112112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2010200111221) 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, 777338271 + ... + 777340856.
It is an arithmetic number, because the mean of its divisors is an integer number (335810691648).
Almost surely, 22010200111211 is an apocalyptic number.
2010200111211 is a deficient number, since it is larger than the sum of its proper divisors (676285421973).
2010200111211 is a wasteful number, since it uses less digits than its factorization.
2010200111211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1554679561.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 2010200111211 its reverse (1121110020102), we get a palindrome (3131310131313).
The spelling of 2010200111211 in words is "two trillion, ten billion, two hundred million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •