Search a number
-
+
1500540451097 is a prime number
BaseRepresentation
bin10101110101011111001…
…011100011100100011001
312022110011020120220020212
4111311133023203210121
5144041101323413342
63105201101300505
7213260535246512
oct25653713434431
95273136526225
101500540451097
11529414a69296
12202993b64735
13ab66739265c
14528ab351a09
1529074a53182
hex15d5f2e3919

1500540451097 has 2 divisors, whose sum is σ = 1500540451098. Its totient is φ = 1500540451096.

The previous prime is 1500540451079. The next prime is 1500540451153. The reversal of 1500540451097 is 7901540450051.

It is a happy number.

Together with previous prime (1500540451079) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1425280210201 + 75260240896 = 1193851^2 + 274336^2 .

It is a cyclic number.

It is not a de Polignac number, because 1500540451097 - 220 = 1500539402521 is a prime.

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

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

Almost surely, 21500540451097 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 126000, while the sum is 41.

The spelling of 1500540451097 in words is "one trillion, five hundred billion, five hundred forty million, four hundred fifty-one thousand, ninety-seven".