Search a number
-
+
106871625304019 is a prime number
BaseRepresentation
bin11000010011001011111101…
…010000110100011111010011
3112000101211100022122021000022
4120103023331100310133103
5103001441042034212034
61015144051421014055
731340135334405002
oct3023137520643723
9460354308567008
10106871625304019
113106400238a354
12bba052b0b432b
134782c495221b4
141c5688577cc39
15c54e99ba6b2e
hex6132fd4347d3

106871625304019 has 2 divisors, whose sum is σ = 106871625304020. Its totient is φ = 106871625304018.

The previous prime is 106871625303979. The next prime is 106871625304027. The reversal of 106871625304019 is 910403526178601.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 106871625304019 - 220 = 106871624255443 is a prime.

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

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅106871625304019 = 213743250608038 is not.

Almost surely, 2106871625304019 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2177280, while the sum is 53.

The spelling of 106871625304019 in words is "one hundred six trillion, eight hundred seventy-one billion, six hundred twenty-five million, three hundred four thousand, nineteen".