Search a number
-
+
5011005611005 = 51002201122201
BaseRepresentation
bin100100011101011011100…
…1101011001101111111101
3122202001021121010002111121
41020322313031121233331
51124100014414023010
614354005120550541
71025014250624452
oct110726715315775
918661247102447
105011005611005
111662179037a49
1268b1bb782451
132a46c7204824
141347692b7829
158a533a1d3da
hex48eb7359bfd

5011005611005 has 4 divisors (see below), whose sum is σ = 6013206733212. Its totient is φ = 4008804488800.

The previous prime is 5011005610993. The next prime is 5011005611047. The reversal of 5011005611005 is 5001165001105.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 2024320001796 + 2986685609209 = 1422786^2 + 1728203^2 .

It is not a de Polignac number, because 5011005611005 - 29 = 5011005610493 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 501100561096 + ... + 501100561105.

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

Almost surely, 25011005611005 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1002201122206.

The product of its (nonzero) digits is 750, while the sum is 25.

The spelling of 5011005611005 in words is "five trillion, eleven billion, five million, six hundred eleven thousand, five".

Divisors: 1 5 1002201122201 5011005611005