Search a number
-
+
15531025457 is a prime number
BaseRepresentation
bin11100111011011100…
…01010010000110001
31111002101100211200002
432131232022100301
5223301420303312
611045043435345
71056605352413
oct163556122061
944071324602
1015531025457
11664a94a332
123015385b55
131606874abc
14a749749b3
1560d75a4c2
hex39db8a431

15531025457 has 2 divisors, whose sum is σ = 15531025458. Its totient is φ = 15531025456.

The previous prime is 15531025387. The next prime is 15531025481. The reversal of 15531025457 is 75452013551.

15531025457 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., 11440655521 + 4090369936 = 106961^2 + 63956^2 .

It is a cyclic number.

It is not a de Polignac number, because 15531025457 - 224 = 15514248241 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 15531025457.

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

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

Almost surely, 215531025457 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 105000, while the sum is 38.

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