Search a number
-
+
106237071 = 3280914591
BaseRepresentation
bin1100101010100…
…00110010001111
321101220101212100
412111100302033
5204144041241
614313010143
72430000033
oct625206217
9241811770
10106237071
1154a71536
122b6b3953
1319018695
14101761c3
1594d79b6
hex6550c8f

106237071 has 12 divisors (see below), whose sum is σ = 153653760. Its totient is φ = 70732320.

The previous prime is 106237057. The next prime is 106237081. The reversal of 106237071 is 170732601.

It is not a de Polignac number, because 106237071 - 25 = 106237039 is a prime.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15 + ... + 14576.

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

Almost surely, 2106237071 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 1764, while the sum is 27.

The square root of 106237071 is about 10307.1368963452. The cubic root of 106237071 is about 473.6149064709.

Adding to 106237071 its reverse (170732601), we get a palindrome (276969672).

The spelling of 106237071 in words is "one hundred six million, two hundred thirty-seven thousand, seventy-one".

Divisors: 1 3 9 809 2427 7281 14591 43773 131319 11804119 35412357 106237071