Search a number
-
+
31668682752 = 2143472487
BaseRepresentation
bin11101011111100110…
…011100000000000000
310000202001012202210000
4131133212130000000
51004324140322002
622314241440000
72200531235100
oct353746340000
9100661182700
1031668682752
1112481167093
126179940000
132ca8cc7c45
141765cdb200
15c5539361c
hex75f99c000

31668682752 has 450 divisors, whose sum is σ = 110285071512. Its totient is φ = 9029615616.

The previous prime is 31668682751. The next prime is 31668682753. The reversal of 31668682752 is 25728686613.

It is an interprime number because it is at equal distance from previous prime (31668682751) and next prime (31668682753).

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

It is a congruent number.

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

It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 65027853 + ... + 65028339.

Almost surely, 231668682752 is an apocalyptic number.

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

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

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

31668682752 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its digits is 5806080, while the sum is 54.

The spelling of 31668682752 in words is "thirty-one billion, six hundred sixty-eight million, six hundred eighty-two thousand, seven hundred fifty-two".