Base | Representation |
---|---|
bin | 110000000001101011000101… |
… | …010000111001000010111010 |
3 | 1000200212112212101020011010112 |
4 | 300001223011100321002322 |
5 | 210141122020033102302 |
6 | 2025121403533144322 |
7 | 62330141343050126 |
oct | 6001530520710272 |
9 | 1020775771204115 |
10 | 211221211222202 |
11 | 6133545a233665 |
12 | 1b83410432b0a2 |
13 | 90b20c830014c |
14 | 3a23238374586 |
15 | 1964535e3e552 |
hex | c01ac54390ba |
211221211222202 has 8 divisors (see below), whose sum is σ = 324199998620256. Its totient is φ = 103154545015452.
The previous prime is 211221211222141. The next prime is 211221211222207. The reversal of 211221211222202 is 202222112122112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2112212112222022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (211221211222207) 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 3 ways as a sum of consecutive naturals, for example, 1228030297718 + ... + 1228030297889.
It is an arithmetic number, because the mean of its divisors is an integer number (40524999827532).
Almost surely, 2211221211222202 is an apocalyptic number.
211221211222202 is a deficient number, since it is larger than the sum of its proper divisors (112978787398054).
211221211222202 is a wasteful number, since it uses less digits than its factorization.
211221211222202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2456060595652.
The product of its (nonzero) digits is 512, while the sum is 23.
Adding to 211221211222202 its reverse (202222112122112), we get a palindrome (413443323344314).
The spelling of 211221211222202 in words is "two hundred eleven trillion, two hundred twenty-one billion, two hundred eleven million, two hundred twenty-two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •