Search a number
-
+
222443701 is a prime number
BaseRepresentation
bin11010100001000…
…11100010110101
3120111120022101121
431100203202311
5423421144301
634023423541
75340511624
oct1520434265
9514508347
10222443701
11104622277
12625b4bb1
1337114abc
14217856bb
15147de3a1
hexd4238b5

222443701 has 2 divisors, whose sum is σ = 222443702. Its totient is φ = 222443700.

The previous prime is 222443699. The next prime is 222443707. The reversal of 222443701 is 107344222.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 113742225 + 108701476 = 10665^2 + 10426^2 .

It is a cyclic number.

It is not a de Polignac number, because 222443701 - 21 = 222443699 is a prime.

It is a super-2 number, since 2×2224437012 = 98962400229154802, which contains 22 as substring.

Together with 222443699, it forms a pair of twin primes.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (222443707) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111221850 + 111221851.

It is an arithmetic number, because the mean of its divisors is an integer number (111221851).

Almost surely, 2222443701 is an apocalyptic number.

It is an amenable number.

222443701 is a deficient number, since it is larger than the sum of its proper divisors (1).

222443701 is an equidigital number, since it uses as much as digits as its factorization.

222443701 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 2688, while the sum is 25.

The square root of 222443701 is about 14914.5466240178. The cubic root of 222443701 is about 605.9080242872.

Adding to 222443701 its reverse (107344222), we get a palindrome (329787923).

The spelling of 222443701 in words is "two hundred twenty-two million, four hundred forty-three thousand, seven hundred one".