Search a number
-
+
106951 = 1319433
BaseRepresentation
bin11010000111000111
312102201011
4122013013
511410301
62143051
7623545
oct320707
9172634
10106951
1173399
1251a87
13398b0
142ad95
1521a51
hex1a1c7

106951 has 8 divisors (see below), whose sum is σ = 121520. Its totient is φ = 93312.

The previous prime is 106949. The next prime is 106957. The reversal of 106951 is 159601.

106951 = 1312 + 1322 + ... + 1362.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a 7-Lehmer number, since φ(106951) divides (106951-1)7.

It is a cyclic number.

It is not a de Polignac number, because 106951 - 21 = 106949 is a prime.

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

It is an Ulam number.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31 + ... + 463.

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

2106951 is an apocalyptic number.

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

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

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

The sum of its prime factors is 465.

The product of its (nonzero) digits is 270, while the sum is 22.

The square root of 106951 is about 327.0336374136. The cubic root of 106951 is about 47.4673459781.

Subtracting from 106951 its sum of digits (22), we obtain a square (106929 = 3272).

Subtracting 106951 from its reverse (159601), we obtain a triangular number (52650 = T324).

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

Divisors: 1 13 19 247 433 5629 8227 106951