Search a number
-
+
106701196 = 2273810757
BaseRepresentation
bin1100101110000…
…10000110001100
321102202222112011
412113002012030
5204303414241
614330551004
72433642130
oct627020614
9242688464
10106701196
1155259208
122b898464
131914ba04
14102573c0
15957a281
hex65c218c

106701196 has 12 divisors (see below), whose sum is σ = 213402448. Its totient is φ = 45729072.

The previous prime is 106701191. The next prime is 106701239. The reversal of 106701196 is 691107601.

106701196 is an admirable number.

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

It is not an unprimeable number, because it can be changed into a prime (106701191) 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 3 ways as a sum of consecutive naturals, for example, 1905351 + ... + 1905406.

Almost surely, 2106701196 is an apocalyptic number.

It is an amenable number.

106701196 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 2268, while the sum is 31.

The square root of 106701196 is about 10329.6270987873. The cubic root of 106701196 is about 474.3036088922.

Adding to 106701196 its reverse (691107601), we get a palindrome (797808797).

The spelling of 106701196 in words is "one hundred six million, seven hundred one thousand, one hundred ninety-six".

Divisors: 1 2 4 7 14 28 3810757 7621514 15243028 26675299 53350598 106701196