Search a number
-
+
15469245137 is a prime number
BaseRepresentation
bin11100110100000100…
…11111001011010001
31110221002010002000002
432122002133023101
5223140111321022
611034555335345
71055225262023
oct163202371321
943832102002
1015469245137
116618a92915
122bb8751555
1315c6b236b8
14a6a692013
15608105092
hex39a09f2d1

15469245137 has 2 divisors, whose sum is σ = 15469245138. Its totient is φ = 15469245136.

The previous prime is 15469245131. The next prime is 15469245161. The reversal of 15469245137 is 73154296451.

It is a happy number.

15469245137 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., 15439553536 + 29691601 = 124256^2 + 5449^2 .

It is a cyclic number.

It is not a de Polignac number, because 15469245137 - 28 = 15469244881 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 15469245091 and 15469245100.

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

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

Almost surely, 215469245137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 907200, while the sum is 47.

The spelling of 15469245137 in words is "fifteen billion, four hundred sixty-nine million, two hundred forty-five thousand, one hundred thirty-seven".