Base | Representation |
---|---|
bin | 11010011111010… |
… | …11011101101101 |
3 | 120111010122022001 |
4 | 31033223131231 |
5 | 423341321442 |
6 | 34014452301 |
7 | 5335534135 |
oct | 1517533555 |
9 | 514118261 |
10 | 222213997 |
11 | 104485735 |
12 | 62504091 |
13 | 37064395 |
14 | 21725ac5 |
15 | 147962b7 |
hex | d3eb76d |
222213997 has 4 divisors (see below), whose sum is σ = 222354396. Its totient is φ = 222073600.
The previous prime is 222213989. The next prime is 222214007. The reversal of 222213997 is 799312222.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 219217636 + 2996361 = 14806^2 + 1731^2 .
It is a cyclic number.
It is not a de Polignac number, because 222213997 - 23 = 222213989 is a prime.
It is a super-3 number, since 3×2222139973 (a number of 26 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222213907) 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, 67798 + ... + 70999.
It is an arithmetic number, because the mean of its divisors is an integer number (55588599).
Almost surely, 2222213997 is an apocalyptic number.
It is an amenable number.
222213997 is a deficient number, since it is larger than the sum of its proper divisors (140399).
222213997 is a wasteful number, since it uses less digits than its factorization.
222213997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140398.
The product of its digits is 27216, while the sum is 37.
The square root of 222213997 is about 14906.8439651054. The cubic root of 222213997 is about 605.6993910748.
The spelling of 222213997 in words is "two hundred twenty-two million, two hundred thirteen thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •