Base | Representation |
---|---|
bin | 1100010101111000100… |
… | …1110010000100101001 |
3 | 202021021221112110001021 |
4 | 3011132021302010221 |
5 | 11433220423121301 |
6 | 241223455252441 |
7 | 21214242635362 |
oct | 3053611620451 |
9 | 667257473037 |
10 | 212033020201 |
11 | 81a171263a2 |
12 | 3511551a121 |
13 | 16cc1275582 |
14 | a396256b69 |
15 | 57aea688a1 |
hex | 315e272129 |
212033020201 has 4 divisors (see below), whose sum is σ = 212057465092. Its totient is φ = 212008575312.
The previous prime is 212033020193. The next prime is 212033020267. The reversal of 212033020201 is 102020330212.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 25616322601 + 186416697600 = 160051^2 + 431760^2 .
It is a cyclic number.
It is not a de Polignac number, because 212033020201 - 23 = 212033020193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212033020271) 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 3 ways as a sum of consecutive naturals, for example, 12209430 + ... + 12226783.
It is an arithmetic number, because the mean of its divisors is an integer number (53014366273).
Almost surely, 2212033020201 is an apocalyptic number.
It is an amenable number.
212033020201 is a deficient number, since it is larger than the sum of its proper divisors (24444891).
212033020201 is an equidigital number, since it uses as much as digits as its factorization.
212033020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24444890.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 212033020201 its reverse (102020330212), we get a palindrome (314053350413).
The spelling of 212033020201 in words is "two hundred twelve billion, thirty-three million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •