Search a number
-
+
10145005261 is a prime number
BaseRepresentation
bin10010111001011000…
…00111111011001101
3222012000121122221121
421130230013323031
5131234110132021
64354402400541
7506255056546
oct113454077315
928160548847
1010145005261
114336655676
121b71660151
13c58a5aac1
146c350b4cd
153e59a2741
hex25cb07ecd

10145005261 has 2 divisors, whose sum is σ = 10145005262. Its totient is φ = 10145005260.

The previous prime is 10145005193. The next prime is 10145005309. The reversal of 10145005261 is 16250054101.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9529469161 + 615536100 = 97619^2 + 24810^2 .

It is an emirp because it is prime and its reverse (16250054101) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10145005261 - 221 = 10142908109 is a prime.

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

It is a congruent number.

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

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

Almost surely, 210145005261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1200, while the sum is 25.

Adding to 10145005261 its reverse (16250054101), we get a palindrome (26395059362).

The spelling of 10145005261 in words is "ten billion, one hundred forty-five million, five thousand, two hundred sixty-one".