Search a number
-
+
12661336850 = 2521913327723
BaseRepresentation
bin10111100101010110…
…01010101100010010
31012200101112112221212
423302223022230102
5201412300234400
65452212220122
7625521405341
oct136253125422
935611475855
1012661336850
115407aa3858
12255430a642
13126a1879c6
148817adb58
154e1857335
hex2f2acab12

12661336850 has 24 divisors (see below), whose sum is σ = 24789566640. Its totient is φ = 4797979920.

The previous prime is 12661336847. The next prime is 12661336921. The reversal of 12661336850 is 5863316621.

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

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

It is an unprimeable number.

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 11 ways as a sum of consecutive naturals, for example, 6662912 + ... + 6664811.

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

Almost surely, 212661336850 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 155520, while the sum is 41.

The spelling of 12661336850 in words is "twelve billion, six hundred sixty-one million, three hundred thirty-six thousand, eight hundred fifty".

Divisors: 1 2 5 10 19 25 38 50 95 190 475 950 13327723 26655446 66638615 133277230 253226737 333193075 506453474 666386150 1266133685 2532267370 6330668425 12661336850