Base | Representation |
---|---|
bin | 1100010010011100100… |
… | …0111100110001011011 |
3 | 202011220121210221211001 |
4 | 3010213020330301123 |
5 | 11424323133230003 |
6 | 240552125045431 |
7 | 21152334600631 |
oct | 3044710746133 |
9 | 664817727731 |
10 | 211110055003 |
11 | 81593138a41 |
12 | 34ab83b6877 |
13 | 16ba4c9ac13 |
14 | a30983d351 |
15 | 5758a0261d |
hex | 312723cc5b |
211110055003 has 8 divisors (see below), whose sum is σ = 212839294976. Its totient is φ = 209387802600.
The previous prime is 211110054997. The next prime is 211110055007. The reversal of 211110055003 is 300550011112.
211110055003 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 a de Polignac number, because none of the positive numbers 2k-211110055003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211110055007) 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, 1686213 + ... + 1807078.
It is an arithmetic number, because the mean of its divisors is an integer number (26604911872).
Almost surely, 2211110055003 is an apocalyptic number.
211110055003 is a deficient number, since it is larger than the sum of its proper divisors (1729239973).
211110055003 is a wasteful number, since it uses less digits than its factorization.
211110055003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3493785.
The product of its (nonzero) digits is 150, while the sum is 19.
Adding to 211110055003 its reverse (300550011112), we get a palindrome (511660066115).
The spelling of 211110055003 in words is "two hundred eleven billion, one hundred ten million, fifty-five thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •