Search a number
-
+
106527034994071 is a prime number
BaseRepresentation
bin11000001110001011000010…
…000101000110110110010111
3111222011212220020011210022011
4120032023002011012312113
5102430314331424302241
61014321502210445051
731303216143164566
oct3016130205066627
9458155806153264
10106527034994071
1130a4095311122a
12bb457a0593787
1347595c1637503
141c43d16575bdd
15c4b02ca34281
hex60e2c2146d97

106527034994071 has 2 divisors, whose sum is σ = 106527034994072. Its totient is φ = 106527034994070.

The previous prime is 106527034994011. The next prime is 106527034994111. The reversal of 106527034994071 is 170499430725601.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 106527034994071 - 223 = 106527026605463 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 106527034993997 and 106527034994015.

It is a congruent number.

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

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

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

Almost surely, 2106527034994071 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 11430720, while the sum is 58.

The spelling of 106527034994071 in words is "one hundred six trillion, five hundred twenty-seven billion, thirty-four million, nine hundred ninety-four thousand, seventy-one".