Search a number
-
+
106701957 = 3211855773
BaseRepresentation
bin1100101110000…
…10010010000101
321102210000120100
412113002102011
5204303430312
614330554313
72433644265
oct627022205
9242700510
10106701957
115525983a
122b898999
131914c16b
14102577a5
15957a5dc
hex65c2485

106701957 has 6 divisors (see below), whose sum is σ = 154125062. Its totient is φ = 71134632.

The previous prime is 106701949. The next prime is 106701977. The reversal of 106701957 is 759107601.

It can be written as a sum of positive squares in only one way, i.e., 102697956 + 4004001 = 10134^2 + 2001^2 .

It is not a de Polignac number, because 106701957 - 23 = 106701949 is a prime.

It is a super-2 number, since 2×1067019572 = 22770615255259698, which contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (106701977) by changing a digit.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5927878 + ... + 5927895.

Almost surely, 2106701957 is an apocalyptic number.

It is an amenable number.

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

106701957 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 11855779 (or 11855776 counting only the distinct ones).

The product of its (nonzero) digits is 13230, while the sum is 36.

The square root of 106701957 is about 10329.6639345140. The cubic root of 106701957 is about 474.3047364778.

The spelling of 106701957 in words is "one hundred six million, seven hundred one thousand, nine hundred fifty-seven".

Divisors: 1 3 9 11855773 35567319 106701957