Base | Representation |
---|---|
bin | 110010100001101111100011… |
… | …101101100100110110101101 |
3 | 1002010211010120212021010200110 |
4 | 302201233203231210312231 |
5 | 213111332340111200323 |
6 | 2104342551310450233 |
7 | 64543642562035422 |
oct | 6241574355446655 |
9 | 1063733525233613 |
10 | 222221133303213 |
11 | 648964a9502910 |
12 | 20b0bb3bb03979 |
13 | 96cc494542095 |
14 | 3cc37bb425d49 |
15 | 1aa5735856793 |
hex | ca1be3b64dad |
222221133303213 has 16 divisors (see below), whose sum is σ = 323231936573952. Its totient is φ = 134678975886000.
The previous prime is 222221133303167. The next prime is 222221133303251. The reversal of 222221133303213 is 312303331122222.
It is not a de Polignac number, because 222221133303213 - 217 = 222221133172141 is a prime.
It is a super-2 number, since 2×2222211333032132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222221133303613) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3326553 + ... + 21342638.
It is an arithmetic number, because the mean of its divisors is an integer number (20201996035872).
Almost surely, 2222221133303213 is an apocalyptic number.
It is an amenable number.
222221133303213 is a deficient number, since it is larger than the sum of its proper divisors (101010803270739).
222221133303213 is a wasteful number, since it uses less digits than its factorization.
222221133303213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24942176.
The product of its (nonzero) digits is 15552, while the sum is 30.
Adding to 222221133303213 its reverse (312303331122222), we get a palindrome (534524464425435).
The spelling of 222221133303213 in words is "two hundred twenty-two trillion, two hundred twenty-one billion, one hundred thirty-three million, three hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •