Search a number
-
+
100005515161 is a prime number
BaseRepresentation
bin101110100100011001…
…0110000111110011001
3100120010120000112121221
41131020302300332121
53114302402441121
6113535241132041
710140141565456
oct1351062607631
9316116015557
10100005515161
1139459562792
121746b78a021
1395799c0b56
144ba9a9882d
152904978b41
hex1748cb0f99

100005515161 has 2 divisors, whose sum is σ = 100005515162. Its totient is φ = 100005515160.

The previous prime is 100005515117. The next prime is 100005515177. The reversal of 100005515161 is 161515500001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 67083590025 + 32921925136 = 259005^2 + 181444^2 .

It is an emirp because it is prime and its reverse (161515500001) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 100005515161 - 227 = 99871297433 is a prime.

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

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

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

Almost surely, 2100005515161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 750, while the sum is 25.

The spelling of 100005515161 in words is "one hundred billion, five million, five hundred fifteen thousand, one hundred sixty-one".