Search a number
-
+
5300916112 = 24331307257
BaseRepresentation
bin1001110111111010…
…11000111110010000
3111200102121102212101
410323331120332100
541324013303422
62234001010144
7245235020632
oct47375307620
914612542771
105300916112
112280257808
12103b323954
136662ba66b
14384032a52
15210596c27
hex13bf58f90

5300916112 has 10 divisors (see below), whose sum is σ = 10270524998. Its totient is φ = 2650458048.

The previous prime is 5300916091. The next prime is 5300916113. The reversal of 5300916112 is 2116190035.

It can be written as a sum of positive squares in only one way, i.e., 4040382096 + 1260534016 = 63564^2 + 35504^2 .

It is a super-2 number, since 2×53009161122 = 56199423252922393088, which contains 22 as substring.

It is not an unprimeable number, because it can be changed into a prime (5300916113) by changing a digit.

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 as a sum of consecutive naturals, namely, 165653613 + ... + 165653644.

Almost surely, 25300916112 is an apocalyptic number.

It is an amenable number.

5300916112 is a deficient number, since it is larger than the sum of its proper divisors (4969608886).

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

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

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

The product of its (nonzero) digits is 1620, while the sum is 28.

The square root of 5300916112 is about 72807.3905039866. The cubic root of 5300916112 is about 1743.6138516757.

The spelling of 5300916112 in words is "five billion, three hundred million, nine hundred sixteen thousand, one hundred twelve".

Divisors: 1 2 4 8 16 331307257 662614514 1325229028 2650458056 5300916112