Search a number
-
+
15051255553 is a prime number
BaseRepresentation
bin11100000010001111…
…11110111100000001
31102211221121000002101
432001013332330001
5221311110134203
610525304350401
71041661363345
oct160107767401
942757530071
1015051255553
116424050084
122b00775401
13155b353a99
14a2ad67625
155d158b41d
hex3811fef01

15051255553 has 2 divisors, whose sum is σ = 15051255554. Its totient is φ = 15051255552.

The previous prime is 15051255497. The next prime is 15051255599. The reversal of 15051255553 is 35555215051.

15051255553 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 14662061569 + 389193984 = 121087^2 + 19728^2 .

It is a cyclic number.

It is not a de Polignac number, because 15051255553 - 229 = 14514384641 is a prime.

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

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

Almost surely, 215051255553 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 93750, while the sum is 37.

The spelling of 15051255553 in words is "fifteen billion, fifty-one million, two hundred fifty-five thousand, five hundred fifty-three".