Search a number
-
+
51051050 = 2521815641
BaseRepresentation
bin1100001010111…
…1101000101010
310120001122212122
43002233220222
5101032113200
65022111242
71156632611
oct302575052
9116048778
1051051050
11268a9456
121511b522
13a76592b
146acc878
154736385
hex30afa2a

51051050 has 24 divisors (see below), whose sum is σ = 95496492. Its totient is φ = 20304000.

The previous prime is 51051037. The next prime is 51051067. The reversal of 51051050 is 5015015.

51051050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 6 ways, for example, as 18344089 + 32706961 = 4283^2 + 5719^2 .

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

It is an unprimeable number.

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 11 ways as a sum of consecutive naturals, for example, 6230 + ... + 11870.

Almost surely, 251051050 is an apocalyptic number.

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

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

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

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

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

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

The square root of 51051050 is about 7145.0017494749. The cubic root of 51051050 is about 370.9666711801.

Adding to 51051050 its reverse (5015015), we get a palindrome (56066065).

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

Divisors: 1 2 5 10 25 50 181 362 905 1810 4525 5641 9050 11282 28205 56410 141025 282050 1021021 2042042 5105105 10210210 25525525 51051050