Search a number
-
+
10496709 = 34129589
BaseRepresentation
bin101000000010…
…101011000101
3201202021210000
4220002223011
510141343314
61012551513
7155135436
oct50025305
921667700
1010496709
115a1a373
123622599
132236992
14157348d
15dc5209
hexa02ac5

10496709 has 10 divisors (see below), whose sum is σ = 15680390. Its totient is φ = 6997752.

The previous prime is 10496699. The next prime is 10496713. The reversal of 10496709 is 90769401.

It can be written as a sum of positive squares in only one way, i.e., 7784100 + 2712609 = 2790^2 + 1647^2 .

It is not a de Polignac number, because 10496709 - 27 = 10496581 is a prime.

It is a super-2 number, since 2×104967092 = 220361799661362, which contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 64714 + ... + 64875.

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

Almost surely, 210496709 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 129601 (or 129592 counting only the distinct ones).

The product of its (nonzero) digits is 13608, while the sum is 36.

The square root of 10496709 is about 3239.8624970822. The cubic root of 10496709 is about 218.9530768300.

The spelling of 10496709 in words is "ten million, four hundred ninety-six thousand, seven hundred nine".

Divisors: 1 3 9 27 81 129589 388767 1166301 3498903 10496709