Search a number
-
+
1055967 = 31122909
BaseRepresentation
bin100000001110011011111
31222122111220
410001303133
5232242332
634344423
711655423
oct4016337
91878456
101055967
11661400
1242b113
132ac843
141d6b83
1515cd2c
hex101cdf

1055967 has 12 divisors (see below), whose sum is σ = 1548120. Its totient is φ = 639760.

The previous prime is 1055959. The next prime is 1055969. The reversal of 1055967 is 7695501.

It is not a de Polignac number, because 1055967 - 23 = 1055959 is a prime.

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

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

It is a congruent number.

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

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

21055967 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 9450, while the sum is 33.

The square root of 1055967 is about 1027.6025496270. The cubic root of 1055967 is about 101.8318066231.

The spelling of 1055967 in words is "one million, fifty-five thousand, nine hundred sixty-seven".

Divisors: 1 3 11 33 121 363 2909 8727 31999 95997 351989 1055967