Search a number
-
+
1369095569 is a prime number
BaseRepresentation
bin101000110011010…
…1011110110010001
310112102012021001022
41101212223312101
510300442024234
6343504245225
745633056162
oct12146536621
93472167038
101369095569
11642900846
12322610815
1318a84ac2a
14cdb89769
15802dce2e
hex519abd91

1369095569 has 2 divisors, whose sum is σ = 1369095570. Its totient is φ = 1369095568.

The previous prime is 1369095499. The next prime is 1369095577. The reversal of 1369095569 is 9655909631.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1306099600 + 62995969 = 36140^2 + 7937^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×13690955692 = 3748845354110867522, which contains 22 as substring.

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

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

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

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

Almost surely, 21369095569 is an apocalyptic number.

It is an amenable number.

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

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

1369095569 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 1968300, while the sum is 53.

The square root of 1369095569 is about 37001.2914504345. The cubic root of 1369095569 is about 1110.3960843325.

The spelling of 1369095569 in words is "one billion, three hundred sixty-nine million, ninety-five thousand, five hundred sixty-nine".