[go: up one dir, main page]

Search a number
-
+
1050010 = 251341197
BaseRepresentation
bin100000000010110011010
31222100100021
410000112122
5232100020
634301054
711632153
oct4002632
91870307
101050010
11657985
1242778a
132a9c10
141d492a
1515b1aa
hex10059a

1050010 has 32 divisors (see below), whose sum is σ = 2095632. Its totient is φ = 376320.

The previous prime is 1049999. The next prime is 1050011. The reversal of 1050010 is 100501.

It can be written as a sum of positive squares in 8 ways, for example, as 294849 + 755161 = 543^2 + 869^2 .

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

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

It is a congruent number.

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

21050010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 258.

The product of its (nonzero) digits is 5, while the sum is 7.

The square root of 1050010 is about 1024.6999560847. The cubic root of 1050010 is about 101.6399583460.

Adding to 1050010 its reverse (100501), we get a palindrome (1150511).

The spelling of 1050010 in words is "one million, fifty thousand, ten".

Divisors: 1 2 5 10 13 26 41 65 82 130 197 205 394 410 533 985 1066 1970 2561 2665 5122 5330 8077 12805 16154 25610 40385 80770 105001 210002 525005 1050010