Search a number
-
+
5306035 = 571979101
BaseRepresentation
bin10100001111011010110011
3100222120111211
4110033122303
52324243120
6305420551
763046330
oct24173263
910876454
105306035
112aa4559
12193a757
13113a187
149c1987
156ec25a
hex50f6b3

5306035 has 32 divisors (see below), whose sum is σ = 7833600. Its totient is φ = 3369600.

The previous prime is 5306033. The next prime is 5306051.

5306035 is nontrivially palindromic in base 10.

It is not a de Polignac number, because 5306035 - 21 = 5306033 is a prime.

It is an Ulam number.

5306035 is a lucky number.

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

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

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

Almost surely, 25306035 is an apocalyptic number.

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

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

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

The sum of its prime factors is 211.

The product of its (nonzero) digits is 1350, while the sum is 22.

The square root of 5306035 is about 2303.4832319772. The cubic root of 5306035 is about 174.4174917752.

The spelling of 5306035 in words is "five million, three hundred six thousand, thirty-five".

Divisors: 1 5 7 19 35 79 95 101 133 395 505 553 665 707 1501 1919 2765 3535 7505 7979 9595 10507 13433 39895 52535 55853 67165 151601 279265 758005 1061207 5306035