Search a number
-
+
5000501051 = 713151363911
BaseRepresentation
bin1001010100000110…
…11001011100111011
3110220111022202212122
410222003121130323
540220112013201
62144110031455
7234626362160
oct45203313473
913814282778
105000501051
11213671a4a7
12b767a858b
13618ca5980
14356192067
151e4004e1b
hex12a0d973b

5000501051 has 16 divisors (see below), whose sum is σ = 6195237888. Its totient is φ = 3930228000.

The previous prime is 5000501041. The next prime is 5000501063. The reversal of 5000501051 is 1501050005.

It is not a de Polignac number, because 5000501051 - 210 = 5000500027 is a prime.

It is a super-2 number, since 2×50005010512 = 50010021522104209202, which contains 22 as substring.

It is not an unprimeable number, because it can be changed into a prime (5000501041) 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, 168215 + ... + 195696.

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

Almost surely, 25000501051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 364082.

The product of its (nonzero) digits is 125, while the sum is 17.

The square root of 5000501051 is about 70714.2209954971. The cubic root of 5000501051 is about 1710.0330637794.

Adding to 5000501051 its reverse (1501050005), we get a palindrome (6501551056).

The spelling of 5000501051 in words is "five billion, five hundred one thousand, fifty-one".

Divisors: 1 7 13 91 151 1057 1963 13741 363911 2547377 4730843 33115901 54950561 384653927 714357293 5000501051