Search a number
-
+
10639433 = 717293083
BaseRepresentation
bin101000100101…
…100001001001
3202000112120002
4220211201021
510210430213
61020012345
7156301520
oct50454111
922015502
1010639433
116007622
1236910b5
13228692c
1415ad4b7
15e02658
hexa25849

10639433 has 16 divisors (see below), whose sum is σ = 13322880. Its totient is φ = 8284416.

The previous prime is 10639429. The next prime is 10639439. The reversal of 10639433 is 33493601.

It is not a de Polignac number, because 10639433 - 22 = 10639429 is a prime.

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

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1910 + ... + 4992.

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

Almost surely, 210639433 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3136.

The product of its (nonzero) digits is 5832, while the sum is 29.

The square root of 10639433 is about 3261.8143724007. The cubic root of 10639433 is about 219.9409827920.

Subtracting from 10639433 its product of nonzero digits (5832), we obtain a palindrome (10633601).

The spelling of 10639433 in words is "ten million, six hundred thirty-nine thousand, four hundred thirty-three".

Divisors: 1 7 17 29 119 203 493 3083 3451 21581 52411 89407 366877 625849 1519919 10639433