Search a number
-
+
5101010141 = 59281313983
BaseRepresentation
bin1001100000000101…
…10011110011011101
3111011111110011102112
410300002303303131
540421324311031
62202100203405
7240256604453
oct46002636335
914144404375
105101010141
112188429467
12ba4399565
13633a670c6
143656769d3
151ecc5a62b
hex1300b3cdd

5101010141 has 16 divisors (see below), whose sum is σ = 5227873920. Its totient is φ = 4975676160.

The previous prime is 5101010111. The next prime is 5101010153. The reversal of 5101010141 is 1410101015.

It is a cyclic number.

It is not a de Polignac number, because 5101010141 - 214 = 5100993757 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 25101010141 is an apocalyptic number.

It is an amenable number.

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

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

5101010141 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 1636.

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

The square root of 5101010141 is about 71421.3563368829. The cubic root of 5101010141 is about 1721.4142574287.

Adding to 5101010141 its reverse (1410101015), we get a palindrome (6511111156).

It can be divided in two parts, 510101014 and 1, that added together give a palindrome (510101015).

The spelling of 5101010141 in words is "five billion, one hundred one million, ten thousand, one hundred forty-one".

Divisors: 1 59 281 313 983 16579 18467 57997 87953 276223 307679 5189227 16297157 18153061 86457799 5101010141