Search a number
-
+
1056950 = 25221139
BaseRepresentation
bin100000010000010110110
31222200212022
410002002312
5232310300
634353142
711661326
oct4020266
91880768
101056950
11662114
1242b7b2
132b011b
141d7286
1515d285
hex1020b6

1056950 has 12 divisors (see below), whose sum is σ = 1966020. Its totient is φ = 422760.

The previous prime is 1056949. The next prime is 1056959. The reversal of 1056950 is 596501.

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

It is a Curzon number.

It is a congruent number.

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

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

21056950 is an apocalyptic number.

1056950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

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

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

The square root of 1056950 is about 1028.0807361292. The cubic root of 1056950 is about 101.8633952431.

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

Divisors: 1 2 5 10 25 50 21139 42278 105695 211390 528475 1056950