Base | Representation |
---|---|
bin | 1011101100110100100… |
… | …0010101100001011001 |
3 | 201012211201210112000122 |
4 | 2323031020111201121 |
5 | 11243132030311301 |
6 | 232202010043025 |
7 | 20344133616110 |
oct | 2731510254131 |
9 | 635751715018 |
10 | 201010010201 |
11 | 7827aa01880 |
12 | 32b59a19475 |
13 | 15c55652750 |
14 | 9a2c2b6c77 |
15 | 5366e8181b |
hex | 2ecd215859 |
201010010201 has 32 divisors (see below), whose sum is σ = 270688873728. Its totient is φ = 144153354240.
The previous prime is 201010010183. The next prime is 201010010219. The reversal of 201010010201 is 102010010102.
It is an interprime number because it is at equal distance from previous prime (201010010183) and next prime (201010010219).
It is not a de Polignac number, because 201010010201 - 26 = 201010010137 is a prime.
It is a super-2 number, since 2×2010100102012 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (201010010281) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 39401 + ... + 635273.
It is an arithmetic number, because the mean of its divisors is an integer number (8459027304).
Almost surely, 2201010010201 is an apocalyptic number.
It is an amenable number.
201010010201 is a deficient number, since it is larger than the sum of its proper divisors (69678863527).
201010010201 is a wasteful number, since it uses less digits than its factorization.
201010010201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 596241.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 201010010201 its reverse (102010010102), we get a palindrome (303020020303).
Subtracting from 201010010201 its reverse (102010010102), we obtain a palindrome (99000000099).
The spelling of 201010010201 in words is "two hundred one billion, ten million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •