Search a number
-
+
331095927000 = 233531725725261
BaseRepresentation
bin1001101000101101101…
…10101110100011011000
31011122121122101210100010
410310112312232203120
520411041024131000
6412034154441520
732630602641546
oct4642666564330
91148548353303
10331095927000
11118465023523
12542034332a0
13252b7279807
141204cd48d96
15892c616d50
hex4d16dae8d8

331095927000 has 256 divisors, whose sum is σ = 1098084574080. Its totient is φ = 82771968000.

The previous prime is 331095926897. The next prime is 331095927023. The reversal of 331095927000 is 729590133.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 13094370 + ... + 13119630.

Almost surely, 2331095927000 is an apocalyptic number.

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

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

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

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

331095927000 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 51030, while the sum is 39.

The spelling of 331095927000 in words is "three hundred thirty-one billion, ninety-five million, nine hundred twenty-seven thousand".