Base | Representation |
---|---|
bin | 1011110000100000110… |
… | …0101111100100010001 |
3 | 201022101210120002112202 |
4 | 2330020030233210101 |
5 | 11302144230134301 |
6 | 232444210532545 |
7 | 20410526231030 |
oct | 2741014574421 |
9 | 638353502482 |
10 | 202001021201 |
11 | 78739346031 |
12 | 33195897155 |
13 | 16082a632a5 |
14 | 9ac3b64717 |
15 | 53c3e8966b |
hex | 2f0832f911 |
202001021201 has 8 divisors (see below), whose sum is σ = 230861784384. Its totient is φ = 173141126640.
The previous prime is 202001021191. The next prime is 202001021203. The reversal of 202001021201 is 102120100202.
It is a happy number.
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-202001021201 is a prime.
It is not an unprimeable number, because it can be changed into a prime (202001021203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 396971 + ... + 749391.
It is an arithmetic number, because the mean of its divisors is an integer number (28857723048).
Almost surely, 2202001021201 is an apocalyptic number.
It is an amenable number.
202001021201 is a deficient number, since it is larger than the sum of its proper divisors (28860763183).
202001021201 is an equidigital number, since it uses as much as digits as its factorization.
202001021201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434311.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 202001021201 its reverse (102120100202), we get a palindrome (304121121403).
It can be divided in two parts, 20200 and 1021201, that added together give a palindrome (1041401).
The spelling of 202001021201 in words is "two hundred two billion, one million, twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.237 sec. • engine limits •