Search a number
-
+
10151011489 is a prime number
BaseRepresentation
bin10010111010000110…
…00010010010100001
3222012102220210221111
421131003002102201
5131242124331424
64355135223321
7506360113453
oct113503022241
928172823844
1010151011489
114339a881a3
121b73677b41
13c5a081898
146c42322d3
153e628c194
hex25d0c24a1

10151011489 has 2 divisors, whose sum is σ = 10151011490. Its totient is φ = 10151011488.

The previous prime is 10151011483. The next prime is 10151011511. The reversal of 10151011489 is 98411015101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10142101264 + 8910225 = 100708^2 + 2985^2 .

It is a cyclic number.

It is not a de Polignac number, because 10151011489 - 223 = 10142622881 is a prime.

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

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

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

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

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

Almost surely, 210151011489 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 10151011489 in words is "ten billion, one hundred fifty-one million, eleven thousand, four hundred eighty-nine".