Search a number
-
+
106337074757 is a prime number
BaseRepresentation
bin110001100001000101…
…1101111111001000101
3101011110210222002120012
41203002023233321011
53220234242343012
6120503420320005
710453063136054
oct1430213577105
9334423862505
10106337074757
1141108563171
12187380a3005
13a048687514
14520a93439b
152b75756622
hex18c22efe45

106337074757 has 2 divisors, whose sum is σ = 106337074758. Its totient is φ = 106337074756.

The previous prime is 106337074733. The next prime is 106337074783. The reversal of 106337074757 is 757470733601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 98395769761 + 7941304996 = 313681^2 + 89114^2 .

It is a cyclic number.

It is not a de Polignac number, because 106337074757 - 224 = 106320297541 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2106337074757 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2593080, while the sum is 50.

The spelling of 106337074757 in words is "one hundred six billion, three hundred thirty-seven million, seventy-four thousand, seven hundred fifty-seven".