Search a number
BaseRepresentation
bin101000011110…
…000111110001
3201222000000000
4220132013301
510203443022
61015220213
7156114300
oct50360761
921860000
1010609137
115a96890
123677669
132275bc6
1415a2437
15de86ac
hexa1e1f1

10609137 has 60 divisors (see below), whose sum is σ = 20194416. Its totient is φ = 5511240.

The previous prime is 10609133. The next prime is 10609153. The reversal of 10609137 is 73190601.

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

It is not a de Polignac number, because 10609137 - 22 = 10609133 is a prime.

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

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

It is a Leyland number of the form 96 + 69.

It is a self number, because there is not a number n which added to its sum of digits gives 10609137.

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

It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 964462 + ... + 964472.

Almost surely, 210609137 is an apocalyptic number.

It is an amenable number.

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

10609137 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 1134, while the sum is 27.

The square root of 10609137 is about 3257.1670205871. The cubic root of 10609137 is about 219.7320221987.

Adding to 10609137 its reverse (73190601), we get a palindrome (83799738).

The spelling of 10609137 in words is "ten million, six hundred nine thousand, one hundred thirty-seven".