Search a number
-
+
1691059 = 10511609
BaseRepresentation
bin110011100110110110011
310011220200211
412130312303
5413103214
6100124551
720242126
oct6346663
93156624
101691059
11a55577
12696757
13472936
143203bd
152360c4
hex19cdb3

1691059 has 4 divisors (see below), whose sum is σ = 1693720. Its totient is φ = 1688400.

The previous prime is 1691051. The next prime is 1691069. The reversal of 1691059 is 9501961.

It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 9501961 = 71357423.

It is a cyclic number.

It is not a de Polignac number, because 1691059 - 23 = 1691051 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 1691059.

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

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

21691059 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2660.

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

The square root of 1691059 is about 1300.4072439048. The cubic root of 1691059 is about 119.1387173166.

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

Divisors: 1 1051 1609 1691059