Search a number
-
+
10145272751 is a prime number
BaseRepresentation
bin10010111001011010…
…01001001110101111
3222012001010020212122
421130231021032233
5131234142212001
64354412223155
7506260252445
oct113455111657
928161106778
1010145272751
114336818639
121b7176aabb
13c58b22793
146c357ab95
153e5a06b1b
hex25cb493af

10145272751 has 2 divisors, whose sum is σ = 10145272752. Its totient is φ = 10145272750.

The previous prime is 10145272741. The next prime is 10145272759. The reversal of 10145272751 is 15727254101.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10145272751 - 210 = 10145271727 is a prime.

It is a congruent number.

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

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

Almost surely, 210145272751 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 19600, while the sum is 35.

The spelling of 10145272751 in words is "ten billion, one hundred forty-five million, two hundred seventy-two thousand, seven hundred fifty-one".