Base | Representation |
---|---|
bin | 1100010110001011010… |
… | …0000101111001001111 |
3 | 202021111101200102102100 |
4 | 3011202310011321033 |
5 | 11433400433022203 |
6 | 241235331330143 |
7 | 21216212424123 |
oct | 3054264057117 |
9 | 667441612370 |
10 | 212111220303 |
11 | 81a57288284 |
12 | 35137750953 |
13 | 17004525618 |
14 | a3a27b1583 |
15 | 57b6863ea3 |
hex | 3162d05e4f |
212111220303 has 48 divisors (see below), whose sum is σ = 329901445120. Its totient is φ = 130925507328.
The previous prime is 212111220301. The next prime is 212111220323. The reversal of 212111220303 is 303022111212.
212111220303 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 212111220303 - 21 = 212111220301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212111220301) 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 47 ways as a sum of consecutive naturals, for example, 1382151 + ... + 1527927.
Almost surely, 2212111220303 is an apocalyptic number.
212111220303 is a deficient number, since it is larger than the sum of its proper divisors (117790224817).
212111220303 is a wasteful number, since it uses less digits than its factorization.
212111220303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145996 (or 145993 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 212111220303 its reverse (303022111212), we get a palindrome (515133331515).
It can be divided in two parts, 2121112 and 20303, that added together give a triangular number (2141415 = T2069).
The spelling of 212111220303 in words is "two hundred twelve billion, one hundred eleven million, two hundred twenty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •