Search a number
-
+
101406411571 is a prime number
BaseRepresentation
bin101111001110001001…
…0110000101100110011
3100200202012001110020011
41132130102300230303
53130140020132241
6114330243155351
710216642163533
oct1363422605463
9320665043204
10101406411571
113a008303a13
12177a0975b57
139740cc463a
144c9db614c3
152987949281
hex179c4b0b33

101406411571 has 2 divisors, whose sum is σ = 101406411572. Its totient is φ = 101406411570.

The previous prime is 101406411553. The next prime is 101406411643. The reversal of 101406411571 is 175114604101.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 101406411571 - 213 = 101406403379 is a prime.

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

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

Almost surely, 2101406411571 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3360, while the sum is 31.

The spelling of 101406411571 in words is "one hundred one billion, four hundred six million, four hundred eleven thousand, five hundred seventy-one".