[go: up one dir, main page]

Search a number
-
+
51051101 = 452311287
BaseRepresentation
bin1100001010111…
…1101001011101
310120001122221112
43002233221131
5101032113401
65022111405
71156633013
oct302575135
9116048845
1051051101
11268a94a2
121511b565
13a76596a
146acc8b3
1547363bb
hex30afa5d

51051101 has 4 divisors (see below), whose sum is σ = 51066912. Its totient is φ = 51035292.

The previous prime is 51051097. The next prime is 51051103. The reversal of 51051101 is 10115015.

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 a cyclic number.

It is not a de Polignac number, because 51051101 - 22 = 51051097 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 (51051103) 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, 1121 + ... + 10166.

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

Almost surely, 251051101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 15810.

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

The square root of 51051101 is about 7145.0053184025. The cubic root of 51051101 is about 370.9667947120.

Adding to 51051101 its reverse (10115015), we get a palindrome (61166116).

The spelling of 51051101 in words is "fifty-one million, fifty-one thousand, one hundred one".

Divisors: 1 4523 11287 51051101