Base | Representation |
---|---|
bin | 1011101101100010000… |
… | …0111100011000011001 |
3 | 201020100001012022202201 |
4 | 2323120200330120121 |
5 | 11244024424311301 |
6 | 232232551530201 |
7 | 20351643240322 |
oct | 2733040743031 |
9 | 636301168681 |
10 | 201201010201 |
11 | 783687a7a14 |
12 | 32bb1989961 |
13 | 15c860a83b9 |
14 | 9a497d5449 |
15 | 5378b0e201 |
hex | 2ed883c619 |
201201010201 has 4 divisors (see below), whose sum is σ = 208138976100. Its totient is φ = 194263044304.
The previous prime is 201201010189. The next prime is 201201010303. The reversal of 201201010201 is 102010102102.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 102010102102 = 2 ⋅51005051051.
It can be written as a sum of positive squares in 2 ways, for example, as 160920520201 + 40280490000 = 401149^2 + 200700^2 .
It is a cyclic number.
It is not a de Polignac number, because 201201010201 - 29 = 201201009689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201201010601) 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, 3468982906 + ... + 3468982963.
It is an arithmetic number, because the mean of its divisors is an integer number (52034744025).
Almost surely, 2201201010201 is an apocalyptic number.
It is an amenable number.
201201010201 is a deficient number, since it is larger than the sum of its proper divisors (6937965899).
201201010201 is an equidigital number, since it uses as much as digits as its factorization.
201201010201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6937965898.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 201201010201 its reverse (102010102102), we get a palindrome (303211112303).
The spelling of 201201010201 in words is "two hundred one billion, two hundred one million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •