Search a number
-
+
15015505457 is a prime number
BaseRepresentation
bin11011111101111111…
…00110111000110001
31102202110022201011202
431332333212320301
5221222432133312
610521550220545
71041045455561
oct157677467061
942673281152
1015015505457
116405952547
122ab07b4755
131553b17794
14a262dcda1
155cd3789c2
hex37efe6e31

15015505457 has 2 divisors, whose sum is σ = 15015505458. Its totient is φ = 15015505456.

The previous prime is 15015505429. The next prime is 15015505469. The reversal of 15015505457 is 75450551051.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 12144260401 + 2871245056 = 110201^2 + 53584^2 .

It is an emirp because it is prime and its reverse (75450551051) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 15015505457 - 232 = 10720538161 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 215015505457 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 87500, while the sum is 38.

The spelling of 15015505457 in words is "fifteen billion, fifteen million, five hundred five thousand, four hundred fifty-seven".