Search a number
-
+
5308941 = 311160877
BaseRepresentation
bin10100010000001000001101
3100222201111110
4110100020031
52324341231
6305442233
763060651
oct24201015
910881443
105308941
112aa6760
121940379
13113b5b1
149c2a61
156ed046
hex51020d

5308941 has 8 divisors (see below), whose sum is σ = 7722144. Its totient is φ = 3217520.

The previous prime is 5308931. The next prime is 5308949. The reversal of 5308941 is 1498035.

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 5308941 - 27 = 5308813 is a prime.

It is a Curzon number.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 80406 + ... + 80471.

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

Almost surely, 25308941 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 160891.

The product of its (nonzero) digits is 4320, while the sum is 30.

The square root of 5308941 is about 2304.1139294748. The cubic root of 5308941 is about 174.4493275199.

Subtracting from 5308941 its sum of digits (30), we obtain a triangular number (5308911 = T3258).

The spelling of 5308941 in words is "five million, three hundred eight thousand, nine hundred forty-one".

Divisors: 1 3 11 33 160877 482631 1769647 5308941