Base | Representation |
---|---|
bin | 1011110000100011011… |
… | …0101000101110001011 |
3 | 201022102120020001000212 |
4 | 2330020312220232023 |
5 | 11302210033100321 |
6 | 232445242151335 |
7 | 20411021460404 |
oct | 2741066505613 |
9 | 638376201025 |
10 | 202012003211 |
11 | 78744566a77 |
12 | 331994b254b |
13 | 16085109b15 |
14 | 9ac53c29ab |
15 | 53c4e0855b |
hex | 2f08da8b8b |
202012003211 has 4 divisors (see below), whose sum is σ = 202798042392. Its totient is φ = 201225964032.
The previous prime is 202012003199. The next prime is 202012003217. The reversal of 202012003211 is 112300210202.
It is a happy number.
202012003211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 202012003211 - 230 = 200938261387 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202012003217) 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 3 ways as a sum of consecutive naturals, for example, 393019205 + ... + 393019718.
It is an arithmetic number, because the mean of its divisors is an integer number (50699510598).
Almost surely, 2202012003211 is an apocalyptic number.
202012003211 is a deficient number, since it is larger than the sum of its proper divisors (786039181).
202012003211 is an equidigital number, since it uses as much as digits as its factorization.
202012003211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 786039180.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 202012003211 its reverse (112300210202), we get a palindrome (314312213413).
The spelling of 202012003211 in words is "two hundred two billion, twelve million, three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •