Search a number
-
+
5052156335 = 519316128123
BaseRepresentation
bin1001011010010000…
…11100100110101111
3111001002112010121022
410231020130212233
540321323000320
62153153124355
7236124422522
oct45510344657
914032463538
105052156335
1121628a0916
12b8bb596bb
136268c0625
1435cd9abb9
151e880a325
hex12d21c9af

5052156335 has 32 divisors (see below), whose sum is σ = 6695761920. Its totient is φ = 3644611200.

The previous prime is 5052156331. The next prime is 5052156377. The reversal of 5052156335 is 5336512505.

It is not a de Polignac number, because 5052156335 - 22 = 5052156331 is a prime.

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

It is a congruent number.

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

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

Almost surely, 25052156335 is an apocalyptic number.

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

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

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

The sum of its prime factors is 28239.

The product of its (nonzero) digits is 67500, while the sum is 35.

The square root of 5052156335 is about 71078.5223186301. The cubic root of 5052156335 is about 1715.9011303503.

The spelling of 5052156335 in words is "five billion, fifty-two million, one hundred fifty-six thousand, three hundred thirty-five".

Divisors: 1 5 19 31 61 95 155 305 589 1159 1891 2945 5795 9455 28123 35929 140615 179645 534337 871813 1715503 2671685 4359065 8577515 16564447 32594557 53180593 82822235 162972785 265902965 1010431267 5052156335