Base | Representation |
---|---|
bin | 1011101101100001110… |
… | …1001010111000011101 |
3 | 201020022222100001212102 |
4 | 2323120131022320131 |
5 | 11244024201133041 |
6 | 232232514414445 |
7 | 20351631650366 |
oct | 2733035127035 |
9 | 636288301772 |
10 | 201200021021 |
11 | 7836819180a |
12 | 32bb1591425 |
13 | 15c85b2009c |
14 | 9a49618b6d |
15 | 53789b609b |
hex | 2ed874ae1d |
201200021021 has 4 divisors (see below), whose sum is σ = 201472281600. Its totient is φ = 200927760444.
The previous prime is 201200020997. The next prime is 201200021027. The reversal of 201200021021 is 120120002102.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 201200021021 - 226 = 201132912157 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201200020993 and 201200021011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201200021027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 136129181 + ... + 136130658.
It is an arithmetic number, because the mean of its divisors is an integer number (50368070400).
Almost surely, 2201200021021 is an apocalyptic number.
It is an amenable number.
201200021021 is a deficient number, since it is larger than the sum of its proper divisors (272260579).
201200021021 is an equidigital number, since it uses as much as digits as its factorization.
201200021021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272260578.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 201200021021 its reverse (120120002102), we get a palindrome (321320023123).
The spelling of 201200021021 in words is "two hundred one billion, two hundred million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •