Search a number
-
+
3056410033152 = 21037431329773
BaseRepresentation
bin101100011110100000001…
…110111111110000000000
3101211012010110200212111020
4230132200032333300000
5400034011432030102
610300032334145440
7433550455425120
oct54364016776000
911735113625436
103056410033152
11a79241868593
12414429652280
131922ab5b0948
14a7d06a8cc80
1554786c17bbc
hex2c7a03bfc00

3056410033152 has 176 divisors, whose sum is σ = 9331854953472. Its totient is φ = 871231242240.

The previous prime is 3056410033121. The next prime is 3056410033213. The reversal of 3056410033152 is 2513300146503.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9103338 + ... + 9433110.

Almost surely, 23056410033152 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 32400, while the sum is 33.

Adding to 3056410033152 its reverse (2513300146503), we get a palindrome (5569710179655).

The spelling of 3056410033152 in words is "three trillion, fifty-six billion, four hundred ten million, thirty-three thousand, one hundred fifty-two".