Search a number
-
+
5132050113 = 3167261339
BaseRepresentation
bin1001100011110010…
…01101111011000001
3111020122212011021010
410301321031323001
541002301100423
62205125351133
7241114464141
oct46171157301
914218764233
105132050113
1121a39aa233
12bb28684a9
1363a314558
14369836921
1520083c693
hex131e4dec1

5132050113 has 12 divisors (see below), whose sum is σ = 6884065520. Its totient is φ = 3400824072.

The previous prime is 5132050103. The next prime is 5132050127. The reversal of 5132050113 is 3110502315.

It is not a de Polignac number, because 5132050113 - 24 = 5132050097 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

It is not an unprimeable number, because it can be changed into a prime (5132050103) 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 11 ways as a sum of consecutive naturals, for example, 52998 + ... + 114336.

Almost surely, 25132050113 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 450, while the sum is 21.

The square root of 5132050113 is about 71638.3285190267. The cubic root of 5132050113 is about 1724.8988375037.

Adding to 5132050113 its reverse (3110502315), we get a palindrome (8242552428).

The spelling of 5132050113 in words is "five billion, one hundred thirty-two million, fifty thousand, one hundred thirteen".

Divisors: 1 3 167 501 27889 61339 83667 184017 10243613 30730839 1710683371 5132050113