Search a number
-
+
10561010 = 251099689
BaseRepresentation
bin101000010010…
…010111110010
3201212112222112
4220102113302
510200423020
61014205322
7155524055
oct50222762
921775875
1010561010
115a63709
123653842
13225a025
14158ca9c
15dd92c5
hexa125f2

10561010 has 16 divisors (see below), whose sum is σ = 19186200. Its totient is φ = 4185216.

The previous prime is 10560997. The next prime is 10561013. The reversal of 10561010 is 1016501.

It can be written as a sum of positive squares in 4 ways, for example, as 9431041 + 1129969 = 3071^2 + 1063^2 .

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

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

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

Almost surely, 210561010 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 9805.

The product of its (nonzero) digits is 30, while the sum is 14.

The square root of 10561010 is about 3249.7707611461. The cubic root of 10561010 is about 219.3992563877.

Adding to 10561010 its reverse (1016501), we get a palindrome (11577511).

The spelling of 10561010 in words is "ten million, five hundred sixty-one thousand, ten".

Divisors: 1 2 5 10 109 218 545 1090 9689 19378 48445 96890 1056101 2112202 5280505 10561010