Search a number
-
+
100144341041 is a prime number
BaseRepresentation
bin101110101000100010…
…0010110000000110001
3100120111020020121221012
41131101010112000301
53120043422403131
6114001120440305
710143445565603
oct1352104260061
9316436217835
10100144341041
113951a962718
12174aa179095
13959c6a9944
144bc02b5173
152911c4c52b
hex1751116031

100144341041 has 2 divisors, whose sum is σ = 100144341042. Its totient is φ = 100144341040.

The previous prime is 100144340993. The next prime is 100144341043. The reversal of 100144341041 is 140143441001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 88479477025 + 11664864016 = 297455^2 + 108004^2 .

It is a cyclic number.

It is not a de Polignac number, because 100144341041 - 26 = 100144340977 is a prime.

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

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

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 100144340998 and 100144341016.

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

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

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

Almost surely, 2100144341041 is an apocalyptic number.

It is an amenable number.

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

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

100144341041 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 768, while the sum is 23.

Adding to 100144341041 its reverse (140143441001), we get a palindrome (240287782042).

The spelling of 100144341041 in words is "one hundred billion, one hundred forty-four million, three hundred forty-one thousand, forty-one".