Search a number
-
+
5060505065 = 571113144169
BaseRepresentation
bin1001011011010000…
…10010110111101001
3111001200020021220112
410231220102313221
540330442130230
62154052104105
7236255404040
oct45550226751
914050207815
105060505065
1121675833a0
12b92905035
136285546c5
14360131557
151e9408d95
hex12da12de9

5060505065 has 16 divisors (see below), whose sum is σ = 7571041920. Its totient is φ = 3154600320.

The previous prime is 5060505061. The next prime is 5060505077. The reversal of 5060505065 is 5605050605.

It is not a de Polignac number, because 5060505065 - 22 = 5060505061 is a prime.

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

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

Almost surely, 25060505065 is an apocalyptic number.

5060505065 is a gapful number since it is divisible by the number (55) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 13144192.

The product of its (nonzero) digits is 22500, while the sum is 32.

The square root of 5060505065 is about 71137.2269982461. The cubic root of 5060505065 is about 1716.8457904437.

It can be divided in two parts, 506050 and 5065, that added together give a palindrome (511115).

The spelling of 5060505065 in words is "five billion, sixty million, five hundred five thousand, sixty-five".

Divisors: 1 5 7 11 35 55 77 385 13144169 65720845 92009183 144585859 460045915 722929295 1012101013 5060505065