Search a number
-
+
91500005251 is a prime number
BaseRepresentation
bin101010100110111010…
…0110100011110000011
322202011210101212111101
41111031310310132003
52444343000132001
6110011242355231
76416312132464
oct1251564643603
9282153355441
1091500005251
1135894405256
12158971bbb17
138822816a55
144600202d6b
1525a7dc7a01
hex154dd34783

91500005251 has 2 divisors, whose sum is σ = 91500005252. Its totient is φ = 91500005250.

The previous prime is 91500005243. The next prime is 91500005287. The reversal of 91500005251 is 15250000519.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 91500005251 - 23 = 91500005243 is a prime.

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

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

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

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

Almost surely, 291500005251 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2250, while the sum is 28.

The spelling of 91500005251 in words is "ninety-one billion, five hundred million, five thousand, two hundred fifty-one".