[go: up one dir, main page]

Search a number
-
+
5169641 = 23733079
BaseRepresentation
bin10011101110000111101001
3100201122102012
4103232013221
52310412031
6302445305
761640561
oct23560751
910648365
105169641
112a11034
121893835
1310c0079
14987da1
156c1b2b
hex4ee1e9

5169641 has 8 divisors (see below), whose sum is σ = 5470080. Its totient is φ = 4875552.

The previous prime is 5169631. The next prime is 5169643. The reversal of 5169641 is 1469615.

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

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 5169641 - 214 = 5153257 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 5169598 and 5169607.

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

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

Almost surely, 25169641 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3175.

The product of its digits is 6480, while the sum is 32.

The square root of 5169641 is about 2273.6844548002. The cubic root of 5169641 is about 172.9100069886.

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

Divisors: 1 23 73 1679 3079 70817 224767 5169641