Search a number
-
+
4151325165469 is a prime number
BaseRepresentation
bin111100011010001110010…
…000110000011110011101
3112200212021222200121002021
4330122032100300132131
51021003403220243334
612455031545300141
7605631464456416
oct74321620603635
915625258617067
104151325165469
111360626916199
1257067a494651
13241611a84471
14104cd4ac280d
1572ebb09b3b4
hex3c68e43079d

4151325165469 has 2 divisors, whose sum is σ = 4151325165470. Its totient is φ = 4151325165468.

The previous prime is 4151325165457. The next prime is 4151325165509. The reversal of 4151325165469 is 9645615231514.

4151325165469 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3914679888025 + 236645277444 = 1978555^2 + 486462^2 .

It is a cyclic number.

It is not a de Polignac number, because 4151325165469 - 211 = 4151325163421 is a prime.

It is a super-2 number, since 2×41513251654692 (a number of 26 digits) contains 22 as substring.

It is a congruent number.

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

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

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

Almost surely, 24151325165469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 3888000, while the sum is 52.

The spelling of 4151325165469 in words is "four trillion, one hundred fifty-one billion, three hundred twenty-five million, one hundred sixty-five thousand, four hundred sixty-nine".