Base | Representation |
---|---|
bin | 1011110001010011000… |
… | …1101001001111010001 |
3 | 201022221111121000010120 |
4 | 2330110301221033101 |
5 | 11303112234134301 |
6 | 232521145220453 |
7 | 20416000551261 |
oct | 2742461511721 |
9 | 638844530116 |
10 | 202212021201 |
11 | 788374614a3 |
12 | 33234491729 |
13 | 160b769c368 |
14 | 9b03bab7a1 |
15 | 53d7767e36 |
hex | 2f14c693d1 |
202212021201 has 8 divisors (see below), whose sum is σ = 270216511200. Its totient is φ = 134507772672.
The previous prime is 202212021133. The next prime is 202212021203. The reversal of 202212021201 is 102120212202.
202212021201 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 not a de Polignac number, because 202212021201 - 226 = 202144912337 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (202212021203) 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, 75058795 + ... + 75061488.
It is an arithmetic number, because the mean of its divisors is an integer number (33777063900).
Almost surely, 2202212021201 is an apocalyptic number.
It is an amenable number.
202212021201 is a deficient number, since it is larger than the sum of its proper divisors (68004489999).
202212021201 is a wasteful number, since it uses less digits than its factorization.
202212021201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150120735.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 202212021201 its reverse (102120212202), we get a palindrome (304332233403).
The spelling of 202212021201 in words is "two hundred two billion, two hundred twelve million, twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •