Search a number
-
+
5006105601081 = 313128361682079
BaseRepresentation
bin100100011011001001100…
…1001010110010000111001
3122201120122002212210112120
41020312103021112100321
51124010001013213311
614351435000431453
71024451651341314
oct110662311262071
918646562783476
105006105601081
111660094114a72
1268a272778589
132a40c5cb5080
1413442260397b
158a348768706
hex48d93256439

5006105601081 has 8 divisors (see below), whose sum is σ = 7188254196480. Its totient is φ = 3080680369872.

The previous prime is 5006105601031. The next prime is 5006105601083. The reversal of 5006105601081 is 1801065016005.

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

It is not a de Polignac number, because 5006105601081 - 27 = 5006105600953 is a prime.

It is a super-2 number, since 2×50061056010812 (a number of 26 digits) contains 22 as substring.

It is a Curzon number.

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

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

Almost surely, 25006105601081 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 128361682095.

The product of its (nonzero) digits is 7200, while the sum is 33.

The spelling of 5006105601081 in words is "five trillion, six billion, one hundred five million, six hundred one thousand, eighty-one".

Divisors: 1 3 13 39 128361682079 385085046237 1668701867027 5006105601081