Search a number
-
+
6688850532000 = 25353713173159197
BaseRepresentation
bin110000101010101111010…
…0011110101011010100000
3212200110002111100021211220
41201111132203311122200
51334042231214011000
622120452052335040
71260152644266120
oct141253643653240
925613074307756
106688850532000
1121497a882478a
12900416614480
133969a992b6a0
14191a56436c80
15b8ed42c91a0
hex6155e8f56a0

6688850532000 has 3072 divisors, whose sum is σ = 30128817438720. Its totient is φ = 1257209856000.

The previous prime is 6688850531977. The next prime is 6688850532037. The reversal of 6688850532000 is 2350588866.

It is a Harshad number since it is a multiple of its sum of digits (51).

It is an unprimeable number.

It is a polite number, since it can be written in 511 ways as a sum of consecutive naturals, for example, 33953555902 + ... + 33953556098.

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

Almost surely, 26688850532000 is an apocalyptic number.

6688850532000 is a gapful number since it is divisible by the number (60) 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 6688850532000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15064408719360).

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

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

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

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

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

The product of its (nonzero) digits is 2764800, while the sum is 51.

The spelling of 6688850532000 in words is "six trillion, six hundred eighty-eight billion, eight hundred fifty million, five hundred thirty-two thousand".