Search a number
-
+
96681312000 = 28325372131731
BaseRepresentation
bin101101000001010100…
…1111011111100000000
3100020112212221112011100
41122002221323330000
53041000403441000
6112225332014400
76661565410200
oct1320251737400
9306485845140
1096681312000
1138003097749
12168a2461400
13916a0b6230
1449723bc400
1527acbe4a00
hex1682a7bf00

96681312000 has 2592 divisors, whose sum is σ = 476336899584. Its totient is φ = 18579456000.

The previous prime is 96681311999. The next prime is 96681312041. The reversal of 96681312000 is 21318669.

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

It is a congruent number.

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 287 ways as a sum of consecutive naturals, for example, 3118751985 + ... + 3118752015.

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

Almost surely, 296681312000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 15552, while the sum is 36.

The spelling of 96681312000 in words is "ninety-six billion, six hundred eighty-one million, three hundred twelve thousand".