Search a number
-
+
10637150051 = 112791112789
BaseRepresentation
bin10011110100000011…
…00000011101100011
31000110022200012200102
421322001200131203
5133241102300201
64515303013015
7524412166163
oct117201403543
930408605612
1010637150051
114569437300
12208a43a16b
1310069c2638
1472ca1a5a3
15423cb826b
hex27a060763

10637150051 has 12 divisors (see below), whose sum is σ = 11840085600. Its totient is φ = 9547721040.

The previous prime is 10637150039. The next prime is 10637150059. The reversal of 10637150051 is 15005173601.

It is not a de Polignac number, because 10637150051 - 210 = 10637149027 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 10637149996 and 10637150023.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 546836 + ... + 565953.

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

Almost surely, 210637150051 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1112890 (or 1112879 counting only the distinct ones).

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

The spelling of 10637150051 in words is "ten billion, six hundred thirty-seven million, one hundred fifty thousand, fifty-one".

Divisors: 1 11 79 121 869 9559 1112789 12240679 87910331 134647469 967013641 10637150051