Search a number
-
+
15161422361 is a prime number
BaseRepresentation
bin11100001111011000…
…01111001000011001
31110010121220001112112
432013230033020121
5222022311003421
610544241522105
71044466651361
oct160754171031
943117801475
1015161422361
116480256028
122b31643335
131578117047
14a3b8439a1
155db09d45b
hex387b0f219

15161422361 has 2 divisors, whose sum is σ = 15161422362. Its totient is φ = 15161422360.

The previous prime is 15161422351. The next prime is 15161422363. The reversal of 15161422361 is 16322416151.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8659419136 + 6502003225 = 93056^2 + 80635^2 .

It is a cyclic number.

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

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

It is a Chen prime.

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

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

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

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

Almost surely, 215161422361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 8640, while the sum is 32.

The spelling of 15161422361 in words is "fifteen billion, one hundred sixty-one million, four hundred twenty-two thousand, three hundred sixty-one".