Search a number
-
+
15795013469 is a prime number
BaseRepresentation
bin11101011010111010…
…01100011101011101
31111202210002211010212
432231131030131131
5224322010412334
611131153542205
71066262253644
oct165535143535
944683084125
1015795013469
116775967444
123089874965
131649474321
14a9ba5235b
15626a03ece
hex3ad74c75d

15795013469 has 2 divisors, whose sum is σ = 15795013470. Its totient is φ = 15795013468.

The previous prime is 15795013433. The next prime is 15795013477. The reversal of 15795013469 is 96431059751.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9064944100 + 6730069369 = 95210^2 + 82037^2 .

It is a cyclic number.

It is not a de Polignac number, because 15795013469 - 228 = 15526578013 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 215795013469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1020600, while the sum is 50.

The spelling of 15795013469 in words is "fifteen billion, seven hundred ninety-five million, thirteen thousand, four hundred sixty-nine".