Base | Representation |
---|---|
bin | 1011101101100010010… |
… | …1000110111011110001 |
3 | 201020100010020210102202 |
4 | 2323120211012323301 |
5 | 11244030214231001 |
6 | 232233031152545 |
7 | 20351655435365 |
oct | 2733045067361 |
9 | 636303223382 |
10 | 201202102001 |
11 | 7836938322a |
12 | 32bb2215755 |
13 | 15c8639b334 |
14 | 9a499db2a5 |
15 | 5378c7796b |
hex | 2ed8946ef1 |
201202102001 has 4 divisors (see below), whose sum is σ = 201203204004. Its totient is φ = 201201000000.
The previous prime is 201202101977. The next prime is 201202102091. The reversal of 201202102001 is 100201202102.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 83058663601 + 118143438400 = 288199^2 + 343720^2 .
It is a cyclic number.
It is not a de Polignac number, because 201202102001 - 218 = 201201839857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201202102091) 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, 204500 + ... + 666501.
It is an arithmetic number, because the mean of its divisors is an integer number (50300801001).
Almost surely, 2201202102001 is an apocalyptic number.
It is an amenable number.
201202102001 is a deficient number, since it is larger than the sum of its proper divisors (1102003).
201202102001 is an equidigital number, since it uses as much as digits as its factorization.
201202102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1102002.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 201202102001 its reverse (100201202102), we get a palindrome (301403304103).
The spelling of 201202102001 in words is "two hundred one billion, two hundred two million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •