106906421137 has 2 divisors, whose sum is σ = 106906421138. Its totient is φ = 106906421136.

The previous prime is 106906421131. The next prime is 106906421159. The reversal of 106906421137 is 731124609601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 97469464401 + 9436956736 = 312201^2 + 97144^2 .

It is a cyclic number.

It is not a de Polignac number, because 106906421137 - 2³ = 106906421129 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 106906421137.

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

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

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

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

Almost surely, 2^106906421137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 54432, while the sum is 40.

The spelling of 106906421137 in words is "one hundred six billion, nine hundred six million, four hundred twenty-one thousand, one hundred thirty-seven".