Search a number
-
+
15155531537 is a prime number
BaseRepresentation
bin11100001110101011…
…10000111100010001
31110010012210202211212
432013111300330101
5222014304002122
610543511345505
71044365615066
oct160725607421
943105722755
1015155531537
1164779a2183
122b2b682295
131576b33953
14a3ab4cc6d
155da7d7ce2
hex387570f11

15155531537 has 2 divisors, whose sum is σ = 15155531538. Its totient is φ = 15155531536.

The previous prime is 15155531513. The next prime is 15155531563. The reversal of 15155531537 is 73513555151.

15155531537 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., 14909386816 + 246144721 = 122104^2 + 15689^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 215155531537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 196875, while the sum is 41.

The spelling of 15155531537 in words is "fifteen billion, one hundred fifty-five million, five hundred thirty-one thousand, five hundred thirty-seven".