Search a number
-
+
5101005251 = 239713271723
BaseRepresentation
bin1001100000000101…
…10010100111000011
3111011111102220201102
410300002302213003
540421324132001
62202100125015
7240256554266
oct46002624703
914144386642
105101005251
112188425821
12ba439676b
13633a64b04
14365674cdd
151ecc58e6b
hex1300b29c3

5101005251 has 16 divisors (see below), whose sum is σ = 5384838144. Its totient is φ = 4822481664.

The previous prime is 5101005223. The next prime is 5101005263. The reversal of 5101005251 is 1525001015.

It is a happy number.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-5101005251 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2959676 + ... + 2961398.

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

Almost surely, 25101005251 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3170.

The product of its (nonzero) digits is 250, while the sum is 20.

The square root of 5101005251 is about 71421.3221034167. The cubic root of 5101005251 is about 1721.4137073600.

Adding to 5101005251 its reverse (1525001015), we get a palindrome (6626006266).

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

Divisors: 1 23 97 1327 1723 2231 30521 39629 128719 167131 2286421 2960537 3844013 52587683 221782837 5101005251