Search a number
-
+
10141107689 is a prime number
BaseRepresentation
bin10010111000111010…
…10000010111101001
3222011202021122111002
421130131100113221
5131232110421224
64354143044345
7506206664426
oct113435202751
928152248432
1010141107689
114334433339
121b702a06b5
13c57cc4a4b
146c2bb4d4d
153e54829ae
hex25c7505e9

10141107689 has 2 divisors, whose sum is σ = 10141107690. Its totient is φ = 10141107688.

The previous prime is 10141107673. The next prime is 10141107727. The reversal of 10141107689 is 98670114101.

10141107689 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is an a-pointer prime, because the next prime (10141107727) can be obtained adding 10141107689 to its sum of digits (38).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10026617689 + 114490000 = 100133^2 + 10700^2 .

It is a cyclic number.

It is not a de Polignac number, because 10141107689 - 24 = 10141107673 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

Almost surely, 210141107689 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12096, while the sum is 38.

The spelling of 10141107689 in words is "ten billion, one hundred forty-one million, one hundred seven thousand, six hundred eighty-nine".