Base | Representation |
---|---|
bin | 110010100000010011010100… |
… | …110111100101011100010011 |
3 | 1002010110122222001200010221122 |
4 | 302200103110313211130103 |
5 | 213103222030101133021 |
6 | 2104225252315512455 |
7 | 64533535464032231 |
oct | 6240232467453423 |
9 | 1063418861603848 |
10 | 222122100021011 |
11 | 648584a9829143 |
12 | 20ab4901a5872b |
13 | 96c30410b8908 |
14 | 3cbcaa492b951 |
15 | 1aa2d8b426bab |
hex | ca04d4de5713 |
222122100021011 has 4 divisors (see below), whose sum is σ = 222326444180352. Its totient is φ = 221917755861672.
The previous prime is 222122100021001. The next prime is 222122100021043. The reversal of 222122100021011 is 110120001221222.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 222122100021011 - 214 = 222122100004627 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (222122100021001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 102172078040 + ... + 102172080213.
It is an arithmetic number, because the mean of its divisors is an integer number (55581611045088).
Almost surely, 2222122100021011 is an apocalyptic number.
222122100021011 is a deficient number, since it is larger than the sum of its proper divisors (204344159341).
222122100021011 is a wasteful number, since it uses less digits than its factorization.
222122100021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204344159340.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 222122100021011 its reverse (110120001221222), we get a palindrome (332242101242233).
The spelling of 222122100021011 in words is "two hundred twenty-two trillion, one hundred twenty-two billion, one hundred million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •