Base | Representation |
---|---|
bin | 1100011010001111010… |
… | …1100110000011100101 |
3 | 202101022102102112121111 |
4 | 3012203311212003211 |
5 | 11443114221230341 |
6 | 241535501345021 |
7 | 21255230142220 |
oct | 3064365460345 |
9 | 671272375544 |
10 | 213202133221 |
11 | 82467056300 |
12 | 353a0b68171 |
13 | 1714954411c |
14 | a4676265b7 |
15 | 582c502681 |
hex | 31a3d660e5 |
213202133221 has 12 divisors (see below), whose sum is σ = 267824168416. Its totient is φ = 166131531720.
The previous prime is 213202133173. The next prime is 213202133251. The reversal of 213202133221 is 122331202312.
213202133221 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 213202133221 - 211 = 213202131173 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 213202133192 and 213202133201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213202133251) 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 11 ways as a sum of consecutive naturals, for example, 125856375 + ... + 125858068.
Almost surely, 2213202133221 is an apocalyptic number.
It is an amenable number.
213202133221 is a deficient number, since it is larger than the sum of its proper divisors (54622035195).
213202133221 is a wasteful number, since it uses less digits than its factorization.
213202133221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251714472 (or 251714461 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 213202133221 its reverse (122331202312), we get a palindrome (335533335533).
The spelling of 213202133221 in words is "two hundred thirteen billion, two hundred two million, one hundred thirty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •