Search a number
-
+
51502641 = 317167547
BaseRepresentation
bin1100010001110…
…1111000110001
310120220121100020
43010131320301
5101141041031
65035514053
71163523321
oct304357061
9116817306
1051502641
1127087773
12152b8929
13a893348
146ba9281
1547c5096
hex311de31

51502641 has 4 divisors (see below), whose sum is σ = 68670192. Its totient is φ = 34335092.

The previous prime is 51502613. The next prime is 51502651. The reversal of 51502641 is 14620515.

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

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 51502641 - 27 = 51502513 is a prime.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (51502651) 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 3 ways as a sum of consecutive naturals, for example, 8583771 + ... + 8583776.

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

Almost surely, 251502641 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 17167550.

The product of its (nonzero) digits is 1200, while the sum is 24.

The square root of 51502641 is about 7176.5340520338. The cubic root of 51502641 is about 372.0573027116.

The spelling of 51502641 in words is "fifty-one million, five hundred two thousand, six hundred forty-one".

Divisors: 1 3 17167547 51502641