Search a number
-
+
15169002997 is a prime number
BaseRepresentation
bin11100010000010010…
…01001110111110101
31110011011011012012211
432020021021313311
5222031231043442
610545112213421
71044621253351
oct161011116765
943134135184
1015169002997
116484563515
122b3409a271
13157986c625
14a3c858461
155dba99617
hex388249df5

15169002997 has 2 divisors, whose sum is σ = 15169002998. Its totient is φ = 15169002996.

The previous prime is 15169002983. The next prime is 15169003013. The reversal of 15169002997 is 79920096151.

15169002997 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., 7674811236 + 7494191761 = 87606^2 + 86569^2 .

It is a cyclic number.

It is not a de Polignac number, because 15169002997 - 27 = 15169002869 is a prime.

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

It is a congruent number.

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

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

Almost surely, 215169002997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 306180, while the sum is 49.

The spelling of 15169002997 in words is "fifteen billion, one hundred sixty-nine million, two thousand, nine hundred ninety-seven".