Search a number
-
+
5011000505065 = 51002200101013
BaseRepresentation
bin100100011101011011011…
…1001111011001011101001
3122202001021020111200110201
41020322312321323023221
51124100012112130230
614354004415312201
71025014156340362
oct110726671731351
918661236450421
105011000505065
11166217616a865
1268b1b9b1b661
132a46c6137769
14134768748b69
158a5333605ca
hex48eb6e7b2e9

5011000505065 has 4 divisors (see below), whose sum is σ = 6013200606084. Its totient is φ = 4008800404048.

The previous prime is 5011000504957. The next prime is 5011000505083. The reversal of 5011000505065 is 5605050001105.

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 1136287777024 + 3874712728041 = 1065968^2 + 1968429^2 .

It is a cyclic number.

It is not a de Polignac number, because 5011000505065 - 221 = 5010998407913 is a prime.

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

It is a Duffinian 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, 501100050502 + ... + 501100050511.

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

Almost surely, 25011000505065 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1002200101018.

The product of its (nonzero) digits is 3750, while the sum is 28.

The spelling of 5011000505065 in words is "five trillion, eleven billion, five hundred five thousand, sixty-five".

Divisors: 1 5 1002200101013 5011000505065