Base | Representation |
---|---|
bin | 1100010010000010110… |
… | …0110000101001100101 |
3 | 202011122002111021222202 |
4 | 3010200230300221211 |
5 | 11424113003031041 |
6 | 240533305104245 |
7 | 21146553265436 |
oct | 3044054605145 |
9 | 664562437882 |
10 | 211002002021 |
11 | 81538147158 |
12 | 34a88188085 |
13 | 16b88797b45 |
14 | a2d935348d |
15 | 574e2aba9b |
hex | 3120b30a65 |
211002002021 has 12 divisors (see below), whose sum is σ = 214769737644. Its totient is φ = 207299284800.
The previous prime is 211002002009. The next prime is 211002002027. The reversal of 211002002021 is 120200200112.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 178704880225 + 32297121796 = 422735^2 + 179714^2 .
It is not a de Polignac number, because 211002002021 - 26 = 211002001957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211002001993 and 211002002011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211002002027) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5973191 + ... + 6008411.
It is an arithmetic number, because the mean of its divisors is an integer number (17897478137).
Almost surely, 2211002002021 is an apocalyptic number.
It is an amenable number.
211002002021 is a deficient number, since it is larger than the sum of its proper divisors (3767735623).
211002002021 is an equidigital number, since it uses as much as digits as its factorization.
211002002021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37060 (or 37001 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 211002002021 its reverse (120200200112), we get a palindrome (331202202133).
The spelling of 211002002021 in words is "two hundred eleven billion, two million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •