Base | Representation |
---|---|
bin | 1011110001010000100… |
… | …0011100011110011101 |
3 | 201022220202021022001220 |
4 | 2330110020130132131 |
5 | 11303102003033041 |
6 | 232520121523553 |
7 | 20415510010002 |
oct | 2742410343635 |
9 | 638822238056 |
10 | 202201221021 |
11 | 78831355128 |
12 | 332309435b9 |
13 | 160b538a517 |
14 | 9b025998a9 |
15 | 53d6832d66 |
hex | 2f1421c79d |
202201221021 has 8 divisors (see below), whose sum is σ = 269605612320. Its totient is φ = 134798821872.
The previous prime is 202201220983. The next prime is 202201221029. The reversal of 202201221021 is 120122102202.
202201221021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-202201221021 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202201221029) 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, 242470 + ... + 680583.
It is an arithmetic number, because the mean of its divisors is an integer number (33700701540).
Almost surely, 2202201221021 is an apocalyptic number.
It is an amenable number.
202201221021 is a deficient number, since it is larger than the sum of its proper divisors (67404391299).
202201221021 is an equidigital number, since it uses as much as digits as its factorization.
202201221021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 996075.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 202201221021 its reverse (120122102202), we get a palindrome (322323323223).
The spelling of 202201221021 in words is "two hundred two billion, two hundred one million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •