1069131 has 16 divisors (see below), whose sum is σ = 1664000. Its totient is φ = 610344.

The previous prime is 1069129. The next prime is 1069141. The reversal of 1069131 is 1319601.

It is a happy number.

It is not a de Polignac number, because 1069131 - 2¹ = 1069129 is a prime.

It is a super-2 number, since 2×1069131² = 2286082190322, which contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (21).

It is a Duffinian number.

1069131 is a lucky number.

It is a junction number, because it is equal to n+sod(n) for n = 1069098 and 1069107.

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

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

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

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

2^1069131 is an apocalyptic number.

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

1069131 is an equidigital number, since it uses as much as digits as its factorization.

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

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

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

The square root of 1069131 is about 1033.9879109545. The cubic root of 1069131 is about 102.2532155460.

The spelling of 1069131 in words is "one million, sixty-nine thousand, one hundred thirty-one".