Search a number
-
+
15169150069 is a prime number
BaseRepresentation
bin11100010000010011…
…01101110001110101
31110011011102122221221
432020021231301311
5222031300300234
610545115310341
71044622435213
oct161011556165
943134378857
1015169150069
116484653a67
122b3414b3b1
1315798c1558
14a3c895cb3
155dbac7eb4
hex38826dc75

15169150069 has 2 divisors, whose sum is σ = 15169150070. Its totient is φ = 15169150068.

The previous prime is 15169150063. The next prime is 15169150081. The reversal of 15169150069 is 96005196151.

15169150069 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., 7954856100 + 7214293969 = 89190^2 + 84937^2 .

It is a cyclic number.

It is not a de Polignac number, because 15169150069 - 25 = 15169150037 is a prime.

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

It is a congruent number.

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

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

Almost surely, 215169150069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 72900, while the sum is 43.

The spelling of 15169150069 in words is "fifteen billion, one hundred sixty-nine million, one hundred fifty thousand, sixty-nine".