Search a number
-
+
100110010141 is a prime number
BaseRepresentation
bin101110100111100000…
…1011000011100011101
3100120101211122102210101
41131033001120130131
53120011130311031
6113553452541101
710142551021531
oct1351701303435
9316354572711
10100110010141
1139502544379
121749a781791
1395955495bb
144bb98d9bc1
15290dc1a361
hex174f05871d

100110010141 has 2 divisors, whose sum is σ = 100110010142. Its totient is φ = 100110010140.

The previous prime is 100110010129. The next prime is 100110010171. The reversal of 100110010141 is 141010011001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 100001412900 + 108597241 = 316230^2 + 10421^2 .

It is a cyclic number.

It is not a de Polignac number, because 100110010141 - 235 = 65750271773 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2100110010141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4, while the sum is 10.

Adding to 100110010141 its reverse (141010011001), we get a palindrome (241120021142).

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