Search a number
-
+
1106922 = 23184487
BaseRepresentation
bin100001110001111101010
32002020102010
410032033222
5240410142
635420350
712260115
oct4161752
92066363
101106922
11696713
124546b6
132c9aab
1420b57c
1516ce9c
hex10e3ea

1106922 has 8 divisors (see below), whose sum is σ = 2213856. Its totient is φ = 368972.

The previous prime is 1106909. The next prime is 1106923. The reversal of 1106922 is 2296011.

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

1106922 is an admirable number.

It is not an unprimeable number, because it can be changed into a prime (1106923) 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, 92238 + ... + 92249.

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

21106922 is an apocalyptic number.

1106922 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.

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

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

The sum of its prime factors is 184492.

The product of its (nonzero) digits is 216, while the sum is 21.

The square root of 1106922 is about 1052.1036070654. The cubic root of 1106922 is about 103.4440875163. Note that the first 3 decimals are identical.

The spelling of 1106922 in words is "one million, one hundred six thousand, nine hundred twenty-two".

Divisors: 1 2 3 6 184487 368974 553461 1106922