Search a number
-
+
106966964992201 is a prime number
BaseRepresentation
bin11000010100100100101111…
…111100110111100011001001
3112000201221102201002020021121
4120110210233330313203021
5103010021321014222301
61015255540105235241
731350052052364406
oct3024445774674311
9460657381066247
10106966964992201
11310a048712a186
12bbb6ab8192b21
13478bc31688782
141c5b32b8c32ad
15c576c9bd83a1
hex61492ff378c9

106966964992201 has 2 divisors, whose sum is σ = 106966964992202. Its totient is φ = 106966964992200.

The previous prime is 106966964992171. The next prime is 106966964992301. The reversal of 106966964992201 is 102299469669601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 85765176380601 + 21201788611600 = 9260949^2 + 4604540^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 106966964992201 - 215 = 106966964959433 is a prime.

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

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

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

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

Almost surely, 2106966964992201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 136048896, while the sum is 70.

The spelling of 106966964992201 in words is "one hundred six trillion, nine hundred sixty-six billion, nine hundred sixty-four million, nine hundred ninety-two thousand, two hundred one".