Base | Representation |
---|---|
bin | 1011101100110010011… |
… | …0110011011110110101 |
3 | 201012211010020221011102 |
4 | 2323030212303132311 |
5 | 11243122303020041 |
6 | 232201053415445 |
7 | 20343666115550 |
oct | 2731446633665 |
9 | 635733227142 |
10 | 201001220021 |
11 | 78275a48668 |
12 | 32b56a9a585 |
13 | 15c53895764 |
14 | 9a2b069697 |
15 | 53662e709b |
hex | 2ecc9b37b5 |
201001220021 has 8 divisors (see below), whose sum is σ = 235318501824. Its totient is φ = 168084643680.
The previous prime is 201001219973. The next prime is 201001220023. The reversal of 201001220021 is 120022100102.
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 not a de Polignac number, because 201001220021 - 230 = 199927478197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201001219984 and 201001220011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201001220023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 350176055 + ... + 350176628.
It is an arithmetic number, because the mean of its divisors is an integer number (29414812728).
Almost surely, 2201001220021 is an apocalyptic number.
It is an amenable number.
201001220021 is a deficient number, since it is larger than the sum of its proper divisors (34317281803).
201001220021 is an equidigital number, since it uses as much as digits as its factorization.
201001220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 700352731.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 201001220021 its reverse (120022100102), we get a palindrome (321023320123).
The spelling of 201001220021 in words is "two hundred one billion, one million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •