[go: up one dir, main page]

Search a number
-
+
106942 = 2114861
BaseRepresentation
bin11010000110111110
312102200211
4122012332
511410232
62143034
7623533
oct320676
9172624
10106942
1173390
1251a7a
13398a4
142ad8a
1521a47
hex1a1be

106942 has 8 divisors (see below), whose sum is σ = 175032. Its totient is φ = 48600.

The previous prime is 106937. The next prime is 106949. The reversal of 106942 is 249601.

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

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

It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 4861 = 106942 / (1 + 0 + 6 + 9 + 4 + 2).

It is a congruent number.

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

106942 is an untouchable number, because it is not equal to the sum of proper divisors of any number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2409 + ... + 2452.

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

2106942 is an apocalyptic number.

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

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

106942 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 4874.

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

The square root of 106942 is about 327.0198770717. The cubic root of 106942 is about 47.4660144708.

It can be divided in two parts, 1069 and 42, that added together give a palindrome (1111).

The spelling of 106942 in words is "one hundred six thousand, nine hundred forty-two".

Divisors: 1 2 11 22 4861 9722 53471 106942