Search a number
-
+
51050050 = 2521021001
BaseRepresentation
bin1100001010111…
…1011001000010
310120001121111121
43002233121002
5101032100200
65022102454
71156626652
oct302573102
9116047447
1051050050
11268a8727
121511aa2a
13a76533c
146acc362
154735e1a
hex30af642

51050050 has 12 divisors (see below), whose sum is σ = 94953186. Its totient is φ = 20420000.

The previous prime is 51050029. The next prime is 51050053. The reversal of 51050050 is 5005015.

It can be written as a sum of positive squares in 3 ways, for example, as 46090521 + 4959529 = 6789^2 + 2227^2 .

It is a super-2 number, since 2×510500502 = 5212215210005000, which contains 22 as substring.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 510451 + ... + 510550.

Almost surely, 251050050 is an apocalyptic number.

51050050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.

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

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

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

The sum of its prime factors is 1021013 (or 1021008 counting only the distinct ones).

The product of its (nonzero) digits is 125, while the sum is 16.

The square root of 51050050 is about 7144.9317701431. The cubic root of 51050050 is about 370.9642489701.

Adding to 51050050 its reverse (5005015), we get a palindrome (56055065).

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

Divisors: 1 2 5 10 25 50 1021001 2042002 5105005 10210010 25525025 51050050