Search a number
-
+
51110002101 = 317036667367
BaseRepresentation
bin101111100110011001…
…001011110110110101
311212220221111010020210
4233212121023312311
51314133130031401
635251332420033
73456360564324
oct574631136665
9155827433223
1051110002101
111a74829a064
129aa4777619
134a86a131c2
14268bd140bb
1514e20544d6
hexbe664bdb5

51110002101 has 4 divisors (see below), whose sum is σ = 68146669472. Its totient is φ = 34073334732.

The previous prime is 51110002093. The next prime is 51110002159. The reversal of 51110002101 is 10120001115.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 51110002101 - 23 = 51110002093 is a prime.

It is a super-2 number, since 2×511100021012 (a number of 22 digits) contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8518333681 + ... + 8518333686.

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

Almost surely, 251110002101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 17036667370.

The product of its (nonzero) digits is 10, while the sum is 12.

Adding to 51110002101 its reverse (10120001115), we get a palindrome (61230003216).

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

Divisors: 1 3 17036667367 51110002101