Search a number
-
+
3110215680000 = 2163254111359
BaseRepresentation
bin101101010000100111010…
…011010000000000000000
3102000100000021111221011100
4231100213103100000000
5401424210203230000
610340451404014400
7440464021036152
oct55204723200000
912010007457140
103110215680000
11a9a042739420
12422944b31400
131973a49140c0
14aa76c9c0ad2
1555d85741a00
hex2d4274d0000

3110215680000 has 2040 divisors, whose sum is σ = 13414099739040. Its totient is φ = 684195840000.

The previous prime is 3110215679981. The next prime is 3110215680029. The reversal of 3110215680000 is 865120113.

It is a super-2 number, since 2×31102156800002 (a number of 26 digits) contains 22 as substring.

It is a congruent number.

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 119 ways as a sum of consecutive naturals, for example, 52715519971 + ... + 52715520029.

Almost surely, 23110215680000 is an apocalyptic number.

3110215680000 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 3110215680000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6707049869520).

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

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

3110215680000 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 1440, while the sum is 27.

The spelling of 3110215680000 in words is "three trillion, one hundred ten billion, two hundred fifteen million, six hundred eighty thousand".