Search a number
-
+
5129641 = 11466331
BaseRepresentation
bin10011100100010110101001
3100122121112201
4103210112221
52303122031
6301540201
761413136
oct23442651
910577481
105129641
112993a80
121874661
1310a7aba
1497758d
156b4d61
hex4e45a9

5129641 has 4 divisors (see below), whose sum is σ = 5595984. Its totient is φ = 4663300.

The previous prime is 5129617. The next prime is 5129647. The reversal of 5129641 is 1469215.

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 5129641 - 29 = 5129129 is a prime.

It is an Ulam number.

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 233155 + ... + 233176.

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

Almost surely, 25129641 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 466342.

The product of its digits is 2160, while the sum is 28.

The square root of 5129641 is about 2264.8710780086. The cubic root of 5129641 is about 172.4628891672.

It can be divided in two parts, 512 and 9641, that added together give a triangular number (10153 = T142).

The spelling of 5129641 in words is "five million, one hundred twenty-nine thousand, six hundred forty-one".

Divisors: 1 11 466331 5129641