Search a number
-
+
4224132101041 is a prime number
BaseRepresentation
bin111101011110000001111…
…001001011001110110001
3112221211020000210010200121
4331132001321023032301
51023202010304213131
612552312310450241
7614116634301616
oct75360171131661
915854200703617
104224132101041
1113894984a2526
125827b9363981
132484458b6b28
1410864040650d
1574d2cd16911
hex3d781e4b3b1

4224132101041 has 2 divisors, whose sum is σ = 4224132101042. Its totient is φ = 4224132101040.

The previous prime is 4224132101029. The next prime is 4224132101047. The reversal of 4224132101041 is 1401012314224.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3704296869025 + 519835232016 = 1924655^2 + 720996^2 .

It is a cyclic number.

It is not a de Polignac number, because 4224132101041 - 213 = 4224132092849 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 4224132100997 and 4224132101015.

It is not a weakly prime, because it can be changed into another prime (4224132101047) 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 as a sum of consecutive naturals, namely, 2112066050520 + 2112066050521.

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

Almost surely, 24224132101041 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 4224132101041 its reverse (1401012314224), we get a palindrome (5625144415265).

The spelling of 4224132101041 in words is "four trillion, two hundred twenty-four billion, one hundred thirty-two million, one hundred one thousand, forty-one".