Search a number
-
+
5307130368 = 2934731753
BaseRepresentation
bin1001111000101010…
…00110001000000000
3111200212022011020000
410330111012020000
541332111132433
62234342120000
7245341602201
oct47425061000
914625264200
105307130368
112283811661
121041420000
13667685037
14384bad5a8
15210dc3113
hex13c546200

5307130368 has 200 divisors, whose sum is σ = 16066538268. Its totient is φ = 1743814656.

The previous prime is 5307130351. The next prime is 5307130373. The reversal of 5307130368 is 8630317035.

It can be written as a sum of positive squares in 2 ways, for example, as 4917936384 + 389193984 = 70128^2 + 19728^2 .

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 3026580 + ... + 3028332.

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

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

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

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

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

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

The product of its (nonzero) digits is 45360, while the sum is 36.

The square root of 5307130368 is about 72850.0540013527. The cubic root of 5307130368 is about 1744.2949309025.

The spelling of 5307130368 in words is "five billion, three hundred seven million, one hundred thirty thousand, three hundred sixty-eight".