Search a number
-
+
5046531113 = 137141913049
BaseRepresentation
bin1001011001100101…
…11111010000101001
3111000200221100020202
410230302333100221
540313402443423
62152432401545
7236025543461
oct45462772051
914020840222
105046531113
11215a6a9578
12b8a0a62b5
136256a10b0
1435c334ba1
151e8098728
hex12ccbf429

5046531113 has 16 divisors (see below), whose sum is σ = 5524848000. Its totient is φ = 4581413760.

The previous prime is 5046531109. The next prime is 5046531151. The reversal of 5046531113 is 3111356405.

It is a cyclic number.

It is not a de Polignac number, because 5046531113 - 22 = 5046531109 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

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

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

It is an arithmetic number, because the mean of its divisors is an integer number (345303000).

Almost surely, 25046531113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 13552.

The product of its (nonzero) digits is 5400, while the sum is 29.

The square root of 5046531113 is about 71038.9408212144. The cubic root of 5046531113 is about 1715.2640486264.

Adding to 5046531113 its reverse (3111356405), we get a palindrome (8157887518).

The spelling of 5046531113 in words is "five billion, forty-six million, five hundred thirty-one thousand, one hundred thirteen".

Divisors: 1 13 71 419 923 5447 13049 29749 169637 386737 926479 5467531 12044227 71077903 388194701 5046531113