Search a number
-
+
108591998832 = 24322696914057
BaseRepresentation
bin110010100100010010…
…1100110011101110000
3101101021222000002212200
41211020211212131300
53234344022430312
6121515251223200
710563003521532
oct1451045463560
9341258002780
10108591998832
1142065396a89
12190672a7b00
13a3178a9615
1453821cb852
152c586c20dc
hex1948966770

108591998832 has 120 divisors (see below), whose sum is σ = 305553278160. Its totient is φ = 36001704960.

The previous prime is 108591998813. The next prime is 108591998833. The reversal of 108591998832 is 238899195801.

108591998832 is a `hidden beast` number, since 1 + 0 + 8 + 591 + 9 + 9 + 8 + 8 + 32 = 666.

It is a Smith number, since the sum of its digits (63) coincides with the sum of the digits of its prime factors.

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

It is a congruent number.

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

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 23 ways as a sum of consecutive naturals, for example, 26764548 + ... + 26768604.

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

Almost surely, 2108591998832 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 108591998832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152776639080).

108591998832 is an abundant number, since it is smaller than the sum of its proper divisors (196961279328).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 11197440, while the sum is 63.

The spelling of 108591998832 in words is "one hundred eight billion, five hundred ninety-one million, nine hundred ninety-eight thousand, eight hundred thirty-two".

Divisors: 1 2 3 4 6 8 9 12 16 18 24 36 48 72 144 269 538 691 807 1076 1382 1614 2073 2152 2421 2764 3228 4057 4146 4304 4842 5528 6219 6456 8114 8292 9684 11056 12171 12438 12912 16228 16584 19368 24342 24876 32456 33168 36513 38736 48684 49752 64912 73026 97368 99504 146052 185879 194736 292104 371758 557637 584208 743516 1091333 1115274 1487032 1672911 2182666 2230548 2803387 2974064 3273999 3345822 4365332 4461096 5606774 6547998 6691644 8410161 8730664 8922192 9821997 11213548 13095996 13383288 16820322 17461328 19643994 22427096 25230483 26191992 26766576 33640644 39287988 44854192 50460966 52383984 67281288 78575976 100921932 134562576 157151952 201843864 403687728 754111103 1508222206 2262333309 3016444412 4524666618 6032888824 6786999927 9049333236 12065777648 13573999854 18098666472 27147999708 36197332944 54295999416 108591998832