Base | Representation |
---|---|
bin | 1100010010000010110… |
… | …0111010111100101011 |
3 | 202011122002120102212001 |
4 | 3010200230322330223 |
5 | 11424113010403303 |
6 | 240533310031431 |
7 | 21146553532426 |
oct | 3044054727453 |
9 | 664562512761 |
10 | 211002044203 |
11 | 81538175915 |
12 | 34a881a8577 |
13 | 16b887b10c2 |
14 | a2d93649bd |
15 | 574e2b931d |
hex | 3120b3af2b |
211002044203 has 8 divisors (see below), whose sum is σ = 211246849872. Its totient is φ = 210757299456.
The previous prime is 211002044179. The next prime is 211002044221. The reversal of 211002044203 is 302440200112.
211002044203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 211002044203 - 25 = 211002044171 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211002044233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13256776 + ... + 13272682.
It is an arithmetic number, because the mean of its divisors is an integer number (26405856234).
Almost surely, 2211002044203 is an apocalyptic number.
211002044203 is a deficient number, since it is larger than the sum of its proper divisors (244805669).
211002044203 is a wasteful number, since it uses less digits than its factorization.
211002044203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30461.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 211002044203 its reverse (302440200112), we get a palindrome (513442244315).
The spelling of 211002044203 in words is "two hundred eleven billion, two million, forty-four thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •