Base | Representation |
---|---|
bin | 1011101101100110110… |
… | …1010010000101000101 |
3 | 201020101102212000211020 |
4 | 2323121231102011011 |
5 | 11244100040201041 |
6 | 232234544501353 |
7 | 20352305315655 |
oct | 2733155220505 |
9 | 636342760736 |
10 | 201221022021 |
11 | 78379026108 |
12 | 32bb861a859 |
13 | 15c8a294006 |
14 | 9a4c324365 |
15 | 537a763866 |
hex | 2ed9b52145 |
201221022021 has 8 divisors (see below), whose sum is σ = 273356860320. Its totient is φ = 131616265872.
The previous prime is 201221022007. The next prime is 201221022049. The reversal of 201221022021 is 120220122102.
201221022021 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 not a de Polignac number, because 201221022021 - 211 = 201221019973 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201221022091) 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, 632770351 + ... + 632770668.
It is an arithmetic number, because the mean of its divisors is an integer number (34169607540).
Almost surely, 2201221022021 is an apocalyptic number.
It is an amenable number.
201221022021 is a deficient number, since it is larger than the sum of its proper divisors (72135838299).
201221022021 is a wasteful number, since it uses less digits than its factorization.
201221022021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1265541075.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 201221022021 its reverse (120220122102), we get a palindrome (321441144123).
The spelling of 201221022021 in words is "two hundred one billion, two hundred twenty-one million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •