Search a number
-
+
10265709 = 33421903
BaseRepresentation
bin100111001010…
…010001101101
3201022112220110
4213022101231
510112000314
61004010233
7153154116
oct47122155
921275813
1010265709
115881863
123530979
1321857ac
14151320d
15d7ba59
hex9ca46d

10265709 has 4 divisors (see below), whose sum is σ = 13687616. Its totient is φ = 6843804.

The previous prime is 10265707. The next prime is 10265713. The reversal of 10265709 is 90756201.

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

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 not a de Polignac number, because 10265709 - 21 = 10265707 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 210265709 is an apocalyptic number.

It is an amenable number.

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

10265709 is an equidigital number, since it uses as much as digits as its factorization.

10265709 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 3421906.

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

The square root of 10265709 is about 3204.0145130757. The cubic root of 10265709 is about 217.3349891247.

The spelling of 10265709 in words is "ten million, two hundred sixty-five thousand, seven hundred nine".

Divisors: 1 3 3421903 10265709