Search a number
BaseRepresentation
bin1100011001011110010001
320010010020210
430121132101
51313000230
6153354333
736424260
oct14313621
96103223
103250065
11191a905
1211089a9
1389a420
146085d7
15442eb0
hex319791

3250065 has 32 divisors (see below), whose sum is σ = 6402816. Its totient is φ = 1370880.

The previous prime is 3250063. The next prime is 3250067. The reversal of 3250065 is 5600523.

Adding to 3250065 its reverse (5600523), we get a palindrome (8850588).

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

It is an interprime number because it is at equal distance from previous prime (3250063) and next prime (3250067).

It is not a de Polignac number, because 3250065 - 21 = 3250063 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (21).

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

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

Almost surely, 23250065 is an apocalyptic number.

3250065 is a gapful number since it is divisible by the number (35) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 2409.

The product of its (nonzero) digits is 900, while the sum is 21.

The square root of 3250065 is about 1802.7936653982. The cubic root of 3250065 is about 148.1257909125.

The spelling of 3250065 in words is "three million, two hundred fifty thousand, sixty-five".