Search a number
-
+
51150231 = 3311172223
BaseRepresentation
bin1100001100011…
…1110110010111
310120020200221000
43003013312113
5101043301411
65024154343
71160525016
oct303076627
9116220830
1051150231
1126966a20
12151689b3
13a79bb12
146b16a7d
154755956
hex30c7d97

51150231 has 16 divisors (see below), whose sum is σ = 82667520. Its totient is φ = 30999960.

The previous prime is 51150181. The next prime is 51150233. The reversal of 51150231 is 13205115.

It is not a de Polignac number, because 51150231 - 26 = 51150167 is a prime.

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

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 85815 + ... + 86408.

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

Almost surely, 251150231 is an apocalyptic number.

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

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

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

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

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

The square root of 51150231 is about 7151.9389678604. The cubic root of 51150231 is about 371.2067514154.

Adding to 51150231 its reverse (13205115), we get a palindrome (64355346).

Subtracting from 51150231 its reverse (13205115), we obtain a triangular number (37945116 = T8711).

The spelling of 51150231 in words is "fifty-one million, one hundred fifty thousand, two hundred thirty-one".

Divisors: 1 3 9 11 27 33 99 297 172223 516669 1550007 1894453 4650021 5683359 17050077 51150231