Search a number
-
+
25645151513 is a prime number
BaseRepresentation
bin10111111000100100…
…011111010100011001
32110012020212200022102
4113320210133110121
5410010124322023
615440424333145
71565340122402
oct277044372431
973166780272
1025645151513
11a9700239a3
124b786141b5
1325590b0687
141353d249a9
15a0165d628
hex5f891f519

25645151513 has 2 divisors, whose sum is σ = 25645151514. Its totient is φ = 25645151512.

The previous prime is 25645151503. The next prime is 25645151531. The reversal of 25645151513 is 31515154652.

Together with next prime (25645151531) 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., 13471780624 + 12173370889 = 116068^2 + 110333^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-25645151513 is a prime.

It is a super-2 number, since 2×256451515132 (a number of 22 digits) contains 22 as substring.

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

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

Almost surely, 225645151513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 90000, while the sum is 38.

The spelling of 25645151513 in words is "twenty-five billion, six hundred forty-five million, one hundred fifty-one thousand, five hundred thirteen".