Search a number
-
+
105000601091 is a prime number
BaseRepresentation
bin110000111001010000…
…1100000011000000011
3101001000200011012100112
41201302201200120003
53210020123213331
6120123035141535
710405004245301
oct1416241403003
9331020135315
10105000601091
1140592113781
12184245a48ab
139b9481bab9
14512123b271
152ae825e32b
hex1872860603

105000601091 has 2 divisors, whose sum is σ = 105000601092. Its totient is φ = 105000601090.

The previous prime is 105000601087. The next prime is 105000601093. The reversal of 105000601091 is 190106000501.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 105000601091 - 22 = 105000601087 is a prime.

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

It is a Sophie Germain prime.

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

It is a Chen prime.

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

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

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

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

Almost surely, 2105000601091 is an apocalyptic number.

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

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

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

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

Adding to 105000601091 its reverse (190106000501), we get a palindrome (295106601592).

The spelling of 105000601091 in words is "one hundred five billion, six hundred one thousand, ninety-one".