Search a number
-
+
10101409141 is a prime number
BaseRepresentation
bin10010110100001011…
…10100010101110101
3222001222120202022111
421122011310111311
5131141430043031
64350204131021
7505215363265
oct113205642565
928058522274
1010101409141
114313a8921a
121b5ab36a71
13c4ca05495
146bb7dd7a5
153e1c401b1
hex25a174575

10101409141 has 2 divisors, whose sum is σ = 10101409142. Its totient is φ = 10101409140.

The previous prime is 10101409139. The next prime is 10101409187. The reversal of 10101409141 is 14190410101.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7217182116 + 2884227025 = 84954^2 + 53705^2 .

It is a cyclic number.

It is not a de Polignac number, because 10101409141 - 21 = 10101409139 is a prime.

Together with 10101409139, it forms a pair of twin primes.

It is a congruent number.

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

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

Almost surely, 210101409141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 144, while the sum is 22.

Adding to 10101409141 its reverse (14190410101), we get a palindrome (24291819242).

The spelling of 10101409141 in words is "ten billion, one hundred one million, four hundred nine thousand, one hundred forty-one".