Search a number
-
+
10001050 = 2521391439
BaseRepresentation
bin100110001001…
…101010011010
3200211002212021
4212021222122
510030013200
6554205054
7151002403
oct46115232
920732767
1010001050
115710a34
12342378a
1320c21a7
1414849aa
15d2841a
hex989a9a

10001050 has 24 divisors (see below), whose sum is σ = 18748800. Its totient is φ = 3968880.

The previous prime is 10001009. The next prime is 10001053. The reversal of 10001050 is 5010001.

10001050 is an esthetic number in base 16, because in such base its adjacent digits differ by 1.

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

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

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

Almost surely, 210001050 is an apocalyptic number.

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

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

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

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

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

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

The square root of 10001050 is about 3162.4436753878. The cubic root of 10001050 is about 215.4510092607.

Adding to 10001050 its reverse (5010001), we get a palindrome (15011051).

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

Divisors: 1 2 5 10 25 50 139 278 695 1390 1439 2878 3475 6950 7195 14390 35975 71950 200021 400042 1000105 2000210 5000525 10001050