Base | Representation |
---|---|
bin | 1100010110001001000… |
… | …0111011011000011001 |
3 | 202021110202100002120011 |
4 | 3011202100323120121 |
5 | 11433341103032301 |
6 | 241234402001521 |
7 | 21216041162155 |
oct | 3054220733031 |
9 | 667422302504 |
10 | 212102002201 |
11 | 81a52061611 |
12 | 351346462a1 |
13 | 1700264891b |
14 | a3a1492065 |
15 | 57b5b42a51 |
hex | 316243b619 |
212102002201 has 8 divisors (see below), whose sum is σ = 218956091904. Its totient is φ = 205248668160.
The previous prime is 212102002199. The next prime is 212102002249. The reversal of 212102002201 is 102200201212.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 212102002201 - 21 = 212102002199 is a prime.
It is a super-3 number, since 3×2121020022013 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212102002601) 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 7 ways as a sum of consecutive naturals, for example, 411900 + ... + 770626.
It is an arithmetic number, because the mean of its divisors is an integer number (27369511488).
Almost surely, 2212102002201 is an apocalyptic number.
It is an amenable number.
212102002201 is a deficient number, since it is larger than the sum of its proper divisors (6854089703).
212102002201 is a wasteful number, since it uses less digits than its factorization.
212102002201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 377831.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 212102002201 its reverse (102200201212), we get a palindrome (314302203413).
The spelling of 212102002201 in words is "two hundred twelve billion, one hundred two million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •