Base | Representation |
---|---|
bin | 1100010010110111010… |
… | …0011000000010111001 |
3 | 202012012102122112200021 |
4 | 3010231310120002321 |
5 | 11430040324232301 |
6 | 241011210410441 |
7 | 21155165150065 |
oct | 3045564300271 |
9 | 665172575607 |
10 | 211222102201 |
11 | 81640408730 |
12 | 34b29a30a21 |
13 | 16bc226c036 |
14 | a31a688aa5 |
15 | 57637868a1 |
hex | 312dd180b9 |
211222102201 has 8 divisors (see below), whose sum is σ = 231582024000. Its totient is φ = 191055165840.
The previous prime is 211222102181. The next prime is 211222102213. The reversal of 211222102201 is 102201222112.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211222102201 - 27 = 211222102073 is a prime.
It is a super-2 number, since 2×2112221022012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211222102241) 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, 48244066 + ... + 48248443.
It is an arithmetic number, because the mean of its divisors is an integer number (28947753000).
Almost surely, 2211222102201 is an apocalyptic number.
It is an amenable number.
211222102201 is a deficient number, since it is larger than the sum of its proper divisors (20359921799).
211222102201 is a wasteful number, since it uses less digits than its factorization.
211222102201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96492719.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 211222102201 its reverse (102201222112), we get a palindrome (313423324313).
The spelling of 211222102201 in words is "two hundred eleven billion, two hundred twenty-two million, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •