Base | Representation |
---|---|
bin | 1100010010000100111… |
… | …1001010010110101001 |
3 | 202011122201110110121102 |
4 | 3010201033022112221 |
5 | 11424122310121301 |
6 | 240534230251145 |
7 | 21150023035502 |
oct | 3044117122651 |
9 | 664581413542 |
10 | 211011020201 |
11 | 815422466a3 |
12 | 34a8b1b6ab5 |
13 | 16b8a604847 |
14 | a2da61dba9 |
15 | 574ee8db6b |
hex | 31213ca5a9 |
211011020201 has 8 divisors (see below), whose sum is σ = 223445333160. Its totient is φ = 198579140608.
The previous prime is 211011020197. The next prime is 211011020219. The reversal of 211011020201 is 102020110112.
It can be written as a sum of positive squares in 4 ways, for example, as 128630539801 + 82380480400 = 358651^2 + 287020^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211011020201 - 22 = 211011020197 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211011020261) 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 7 ways as a sum of consecutive naturals, for example, 428276 + ... + 778101.
It is an arithmetic number, because the mean of its divisors is an integer number (27930666645).
Almost surely, 2211011020201 is an apocalyptic number.
It is an amenable number.
211011020201 is a deficient number, since it is larger than the sum of its proper divisors (12434312959).
211011020201 is a wasteful number, since it uses less digits than its factorization.
211011020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1216683.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 211011020201 its reverse (102020110112), we get a palindrome (313031130313).
The spelling of 211011020201 in words is "two hundred eleven billion, eleven million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •