Base | Representation |
---|---|
bin | 1011110000100101010… |
… | …1001110001111010001 |
3 | 201022110010022101122110 |
4 | 2330021111032033101 |
5 | 11302214111134301 |
6 | 232450130055533 |
7 | 20411146563435 |
oct | 2741125161721 |
9 | 638403271573 |
10 | 202020021201 |
11 | 78749043009 |
12 | 331a011a5a9 |
13 | 160869864ab |
14 | 9ac64ac9c5 |
15 | 53c598e0d6 |
hex | 2f0954e3d1 |
202020021201 has 16 divisors (see below), whose sum is σ = 276741080000. Its totient is φ = 130992147648.
The previous prime is 202020021193. The next prime is 202020021239. The reversal of 202020021201 is 102120020202.
202020021201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 202020021201 - 23 = 202020021193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202020021251) 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 15 ways as a sum of consecutive naturals, for example, 25891 + ... + 636168.
It is an arithmetic number, because the mean of its divisors is an integer number (17296317500).
Almost surely, 2202020021201 is an apocalyptic number.
It is an amenable number.
202020021201 is a deficient number, since it is larger than the sum of its proper divisors (74721058799).
202020021201 is a wasteful number, since it uses less digits than its factorization.
202020021201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 664848.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 202020021201 its reverse (102120020202), we get a palindrome (304140041403).
Subtracting from 202020021201 its reverse (102120020202), we obtain a palindrome (99900000999).
The spelling of 202020021201 in words is "two hundred two billion, twenty million, twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •