Search a number
-
+
2162436461 is a prime number
BaseRepresentation
bin1000000011100100…
…0010100101101101
312120201000011011022
42000321002211231
513412040431321
6554324303525
7104405256323
oct20071024555
95521004138
102162436461
11a0a703579
12504241ba5
1328600bb03
1416729dd13
15c9c9bdab
hex80e4296d

2162436461 has 2 divisors, whose sum is σ = 2162436462. Its totient is φ = 2162436460.

The previous prime is 2162436449. The next prime is 2162436481. The reversal of 2162436461 is 1646342612.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2054899561 + 107536900 = 45331^2 + 10370^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-2162436461 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (2162436481) 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, 1081218230 + 1081218231.

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

Almost surely, 22162436461 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 41472, while the sum is 35.

The square root of 2162436461 is about 46502.0049137669. The cubic root of 2162436461 is about 1293.1466680611.

It can be divided in two parts, 21624 and 36461, that added together give a palindrome (58085).

The spelling of 2162436461 in words is "two billion, one hundred sixty-two million, four hundred thirty-six thousand, four hundred sixty-one".