Search a number
-
+
51060051 = 34790053
BaseRepresentation
bin1100001011000…
…1110101010011
310120002010020000
43002301311103
5101032410201
65022221043
71160001060
oct302616523
9116063200
1051060051
1126905199
1215124783
13a769a63
146ad1c67
154738d86
hex30b1d53

51060051 has 20 divisors (see below), whose sum is σ = 87172272. Its totient is φ = 29176848.

The previous prime is 51060019. The next prime is 51060059. The reversal of 51060051 is 15006015.

51060051 is a `hidden beast` number, since 5 + 10 + 600 + 51 = 666.

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

It is not a de Polignac number, because 51060051 - 25 = 51060019 is a prime.

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

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 19 ways as a sum of consecutive naturals, for example, 44460 + ... + 45593.

Almost surely, 251060051 is an apocalyptic number.

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

51060051 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 150, while the sum is 18.

The square root of 51060051 is about 7145.6316025947. The cubic root of 51060051 is about 370.9884720689.

Adding to 51060051 its reverse (15006015), we get a palindrome (66066066).

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

Divisors: 1 3 7 9 21 27 63 81 189 567 90053 270159 630371 810477 1891113 2431431 5673339 7294293 17020017 51060051