Search a number
-
+
1036961 = 4722063
BaseRepresentation
bin11111101001010100001
31221200102222
43331022201
5231140321
634120425
711546132
oct3751241
91850388
101036961
116490a2
12420115
132a3cb3
141cdc89
151573ab
hexfd2a1

1036961 has 4 divisors (see below), whose sum is σ = 1059072. Its totient is φ = 1014852.

The previous prime is 1036957. The next prime is 1036979. The reversal of 1036961 is 1696301.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 1036961 - 22 = 1036957 is a prime.

It is an alternating number because its digits alternate between odd and even.

It is a Duffinian number.

It is a Curzon number.

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

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

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

21036961 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 22110.

The product of its (nonzero) digits is 972, while the sum is 26.

The square root of 1036961 is about 1018.3128203062. The cubic root of 1036961 is about 101.2171584794.

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

Divisors: 1 47 22063 1036961