Search a number
-
+
15005250049 is a prime number
BaseRepresentation
bin11011111100110000…
…11111001000000001
31102201202000200101211
431332120133020001
5221212321000144
610520542330121
71040562343456
oct157630371001
942652020354
1015005250049
1164000884a9
122aa9289941
1315519668aa
14a24bcd82d
155cc500034
hex37e61f201

15005250049 has 2 divisors, whose sum is σ = 15005250050. Its totient is φ = 15005250048.

The previous prime is 15005250031. The next prime is 15005250079. The reversal of 15005250049 is 94005250051.

15005250049 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., 7992360000 + 7012890049 = 89400^2 + 83743^2 .

It is a cyclic number.

It is not a de Polignac number, because 15005250049 - 221 = 15003152897 is a prime.

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

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

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

Almost surely, 215005250049 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9000, while the sum is 31.

The spelling of 15005250049 in words is "fifteen billion, five million, two hundred fifty thousand, forty-nine".