Search a number
-
+
5125151642 = 2131371738317
BaseRepresentation
bin1001100010111101…
…11001101110011010
3111020011212200100012
410301132321232122
540444014323032
62204321441522
7241002033032
oct46136715632
914204780305
105125151642
1121a0018316
12bb04a02a2
13638a6a610
1436895c8c2
151eee286b2
hex1317b9b9a

5125151642 has 32 divisors (see below), whose sum is σ = 8388736272. Its totient is φ = 2334334464.

The previous prime is 5125151641. The next prime is 5125151657. The reversal of 5125151642 is 2461515215.

It can be written as a sum of positive squares in 8 ways, for example, as 4455429001 + 669722641 = 66749^2 + 25879^2 .

It is a junction number, because it is equal to n+sod(n) for n = 5125151599 and 5125151608.

It is not an unprimeable number, because it can be changed into a prime (5125151641) 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 in 15 ways as a sum of consecutive naturals, for example, 612068 + ... + 620384.

Almost surely, 25125151642 is an apocalyptic number.

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

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

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

The sum of its prime factors is 8642.

The product of its digits is 12000, while the sum is 32.

The square root of 5125151642 is about 71590.1644222165. The cubic root of 5125151642 is about 1724.1256247248.

Adding to 5125151642 its reverse (2461515215), we get a palindrome (7586666857).

The spelling of 5125151642 in words is "five billion, one hundred twenty-five million, one hundred fifty-one thousand, six hundred forty-two".

Divisors: 1 2 13 26 137 173 274 346 1781 2249 3562 4498 8317 16634 23701 47402 108121 216242 308113 616226 1139429 1438841 2278858 2877682 14812577 18704933 29625154 37409866 197121217 394242434 2562575821 5125151642