Search a number
-
+
10500110605 = 517123530713
BaseRepresentation
bin10011100011101101…
…01111100100001101
31000002202210212220101
421301312233210031
5133001012014410
64453525451101
7521126316235
oct116166574415
930082725811
1010500110605
1144a9047566
122050570a91
13cb44b09ca
14718746cc5
15416c48d3a
hex271daf90d

10500110605 has 8 divisors (see below), whose sum is σ = 13341317112. Its totient is φ = 7905965568.

The previous prime is 10500110587. The next prime is 10500110633. The reversal of 10500110605 is 50601100501.

It can be written as a sum of positive squares in 4 ways, for example, as 2039606244 + 8460504361 = 45162^2 + 91981^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 10500110605 - 25 = 10500110573 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61765272 + ... + 61765441.

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

Almost surely, 210500110605 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 123530735.

The product of its (nonzero) digits is 150, while the sum is 19.

The spelling of 10500110605 in words is "ten billion, five hundred million, one hundred ten thousand, six hundred five".

Divisors: 1 5 17 85 123530713 617653565 2100022121 10500110605