Search a number
-
+
3057856368 = 2437217312467
BaseRepresentation
bin1011011001000011…
…0010111101110000
321220002220012100120
42312100302331300
522230302400433
61223232250240
7135530231100
oct26620627560
97802805316
103057856368
11132a097826
127140a0980
13399690888
14210187200
1512d6c17b3
hexb6432f70

3057856368 has 240 divisors, whose sum is σ = 10047642624. Its totient is φ = 795432960.

The previous prime is 3057856313. The next prime is 3057856387. The reversal of 3057856368 is 8636587503.

3057856368 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1238271 + ... + 1240737.

Almost surely, 23057856368 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 3057856368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5023821312).

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

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

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

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

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

The product of its (nonzero) digits is 3628800, while the sum is 51.

The square root of 3057856368 is about 55297.8875545893. The cubic root of 3057856368 is about 1451.4620794265.

The spelling of 3057856368 in words is "three billion, fifty-seven million, eight hundred fifty-six thousand, three hundred sixty-eight".