Base | Representation |
---|---|
bin | 101101111110011010100011… |
… | …111001000010110011111101 |
3 | 222111221020200200102001210220 |
4 | 231332122203321002303331 |
5 | 203000331044310013041 |
6 | 1554013542541251553 |
7 | 60406361504520063 |
oct | 5576324371026375 |
9 | 874836620361726 |
10 | 202201220001021 |
11 | 5947806835213a |
12 | 1a817b4b563bb9 |
13 | 88a965481a5c7 |
14 | 37d083c610033 |
15 | 1859ab767cd66 |
hex | b7e6a3e42cfd |
202201220001021 has 8 divisors (see below), whose sum is σ = 275337831490944. Its totient is φ = 131932710922560.
The previous prime is 202201220001019. The next prime is 202201220001089. The reversal of 202201220001021 is 120100022102202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 202201220001021 - 21 = 202201220001019 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202201220001721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 717025602700 + ... + 717025602981.
It is an arithmetic number, because the mean of its divisors is an integer number (34417228936368).
Almost surely, 2202201220001021 is an apocalyptic number.
It is an amenable number.
202201220001021 is a deficient number, since it is larger than the sum of its proper divisors (73136611489923).
202201220001021 is a wasteful number, since it uses less digits than its factorization.
202201220001021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1434051205731.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 202201220001021 its reverse (120100022102202), we get a palindrome (322301242103223).
The spelling of 202201220001021 in words is "two hundred two trillion, two hundred one billion, two hundred twenty million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •