Search a number
-
+
10500060110 = 251050006011
BaseRepresentation
bin10011100011101101…
…00011001111001110
31000002202201022122012
421301312203033032
5133001003410420
64453524421222
7521126016101
oct116166431716
930082638565
1010500060110
1144a9012631
122050547812
13cb4493a27
14718732738
15416c38dc5
hex271da33ce

10500060110 has 8 divisors (see below), whose sum is σ = 18900108216. Its totient is φ = 4200024040.

The previous prime is 10500060101. The next prime is 10500060163. The reversal of 10500060110 is 1106000501.

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

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

It is a Curzon 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 3 ways as a sum of consecutive naturals, for example, 525002996 + ... + 525003015.

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

Almost surely, 210500060110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1050006018.

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

Adding to 10500060110 its reverse (1106000501), we get a palindrome (11606060611).

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

Divisors: 1 2 5 10 1050006011 2100012022 5250030055 10500060110