Search a number
-
+
10500500495 = 535920872803
BaseRepresentation
bin10011100011110000…
…01110110000001111
31000002210112200201202
421301320032300033
5133001112003440
64453542100115
7521132532032
oct116170166017
930083480652
1010500500495
1144a9293491
12205071a63b
13cb45b9304
14718809019
15416cc4615
hex271e0ec0f

10500500495 has 16 divisors (see below), whose sum is σ = 12646264320. Its totient is φ = 8369999904.

The previous prime is 10500500473. The next prime is 10500500497. The reversal of 10500500495 is 59400500501.

10500500495 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a cyclic number.

It is not a de Polignac number, because 10500500495 - 28 = 10500500239 is a prime.

It is a super-2 number, since 2×105005004952 (a number of 21 digits) contains 22 as substring.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10500500497) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3744764 + ... + 3747566.

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

Almost surely, 210500500495 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5254.

The product of its (nonzero) digits is 4500, while the sum is 29.

The spelling of 10500500495 in words is "ten billion, five hundred million, five hundred thousand, four hundred ninety-five".

Divisors: 1 5 359 1795 2087 2803 10435 14015 749233 1006277 3746165 5031385 5849861 29249305 2100100099 10500500495