Search a number
-
+
5052008366859 = 32203976410127
BaseRepresentation
bin100100110000100001100…
…1010100000001100001011
3122212222010011000220102210
41021201003022200030023
51130233003120214414
614424505520200203
71030665322404636
oct111410312401413
918788104026383
105052008366859
1116785aa021333
12697143469063
132a852cc4a73c
14136738b0cc1d
158b63357ce59
hex498432a030b

5052008366859 has 8 divisors (see below), whose sum is σ = 6736316884480. Its totient is φ = 3367852713576.

The previous prime is 5052008366831. The next prime is 5052008366861. The reversal of 5052008366859 is 9586638002505.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 5052008366859 - 27 = 5052008366731 is a prime.

It is a super-3 number, since 3×50520083668593 (a number of 39 digits) contains 333 as substring.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38138947 + ... + 38271180.

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

Almost surely, 25052008366859 is an apocalyptic number.

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

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

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

The sum of its prime factors is 76432169.

The product of its (nonzero) digits is 15552000, while the sum is 57.

The spelling of 5052008366859 in words is "five trillion, fifty-two billion, eight million, three hundred sixty-six thousand, eight hundred fifty-nine".

Divisors: 1 3 22039 66117 76410127 229230381 1684002788953 5052008366859