Base | Representation |
---|---|
bin | 101101010101010011… |
… | …1000000010010000000 |
3 | 100022021121021022100000 |
4 | 1122222213000102000 |
5 | 3043334004211000 |
6 | 112420035200000 |
7 | 10014315135000 |
oct | 1325247002200 |
9 | 308247238300 |
10 | 97351632000 |
11 | 38317505017 |
12 | 16a4aa46000 |
13 | 9245c3319c |
14 | 49d742c000 |
15 | 27eb9a3000 |
hex | 16aa9c0480 |
97351632000 has 1536 divisors, whose sum is σ = 428605632000. Its totient is φ = 21946982400.
The previous prime is 97351631921. The next prime is 97351632017. The reversal of 97351632000 is 23615379.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 1333583964 + ... + 1333584036.
It is an arithmetic number, because the mean of its divisors is an integer number (279040125).
Almost surely, 297351632000 is an apocalyptic number.
97351632000 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 97351632000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (214302816000).
97351632000 is an abundant number, since it is smaller than the sum of its proper divisors (331254000000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
97351632000 is an frugal number, since it uses more digits than its factorization.
97351632000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138 (or 90 counting only the distinct ones).
The product of its (nonzero) digits is 34020, while the sum is 36.
The spelling of 97351632000 in words is "ninety-seven billion, three hundred fifty-one million, six hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •