Base | Representation |
---|---|
bin | 1100001110010110100… |
… | …0011000110110001001 |
3 | 202002002000202012001122 |
4 | 3003211220120312021 |
5 | 11420100304001301 |
6 | 240251104325025 |
7 | 21113161022342 |
oct | 3034550306611 |
9 | 662060665048 |
10 | 210011000201 |
11 | 81079809892 |
12 | 34850313775 |
13 | 16a5b38b532 |
14 | a2438a90c9 |
15 | 56e22a681b |
hex | 30e5a18d89 |
210011000201 has 4 divisors (see below), whose sum is σ = 210012562500. Its totient is φ = 210009437904.
The previous prime is 210011000161. The next prime is 210011000209. The reversal of 210011000201 is 102000110012.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 201689911801 + 8321088400 = 449099^2 + 91220^2 .
It is a cyclic number.
It is not a de Polignac number, because 210011000201 - 226 = 209943891337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210011000209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 558326 + ... + 855423.
It is an arithmetic number, because the mean of its divisors is an integer number (52503140625).
Almost surely, 2210011000201 is an apocalyptic number.
It is an amenable number.
210011000201 is a deficient number, since it is larger than the sum of its proper divisors (1562299).
210011000201 is a wasteful number, since it uses less digits than its factorization.
210011000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1562298.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 210011000201 its reverse (102000110012), we get a palindrome (312011110213).
The spelling of 210011000201 in words is "two hundred ten billion, eleven million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •