Search a number
-
+
5101331251 = 10767370841
BaseRepresentation
bin1001100000001000…
…00010001100110011
3111011112001110220111
410300010002030303
540421420100001
62202111122151
7240262412602
oct46004021463
914145043814
105101331251
112188628745
12ba4513357
13633b4a303
1436571ba39
151eccc0851
hex130102333

5101331251 has 8 divisors (see below), whose sum is σ = 5156730864. Its totient is φ = 5046074880.

The previous prime is 5101331243. The next prime is 5101331269. The reversal of 5101331251 is 1521331015.

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

It is a cyclic number.

It is not a de Polignac number, because 5101331251 - 23 = 5101331243 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (5101331231) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36591 + ... + 107431.

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

Almost surely, 25101331251 is an apocalyptic number.

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

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

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

The sum of its prime factors is 71621.

The product of its (nonzero) digits is 450, while the sum is 22.

The square root of 5101331251 is about 71423.6042985791. The cubic root of 5101331251 is about 1721.4503778387.

Adding to 5101331251 its reverse (1521331015), we get a palindrome (6622662266).

The spelling of 5101331251 in words is "five billion, one hundred one million, three hundred thirty-one thousand, two hundred fifty-one".

Divisors: 1 107 673 70841 72011 7579987 47675993 5101331251