Search a number
-
+
10500165115 = 511491388823
BaseRepresentation
bin10011100011101101…
…11100110111111011
31000002202220122200021
421301312330313323
5133001020240430
64453530551311
7521126634166
oct116166746773
930082818607
1010500165115
1144a9084510
122050598537
13cb44cc76b
1471875cadd
15416c5a07a
hex271dbcdfb

10500165115 has 16 divisors (see below), whose sum is σ = 13773701376. Its totient is φ = 7620911200.

The previous prime is 10500165101. The next prime is 10500165173. The reversal of 10500165115 is 51156100501.

It is not a de Polignac number, because 10500165115 - 29 = 10500164603 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 10500165115.

It is an unprimeable number.

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

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

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

Almost surely, 210500165115 is an apocalyptic number.

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

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

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

The sum of its prime factors is 389330.

The product of its (nonzero) digits is 750, while the sum is 25.

Adding to 10500165115 its reverse (51156100501), we get a palindrome (61656265616).

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

Divisors: 1 5 11 55 491 2455 5401 27005 388823 1944115 4277053 21385265 190912093 954560465 2100033023 10500165115