Search a number
-
+
104902737 = 3612692131
BaseRepresentation
bin1100100000010…
…11000001010001
321022101121111120
412100023001101
5203323341422
614224232453
72412441612
oct620130121
9238347446
10104902737
115423aa85
122b16b729
131896c234
14dd09c09
15932245c
hex640b051

104902737 has 16 divisors (see below), whose sum is σ = 142758720. Its totient is φ = 68500800.

The previous prime is 104902727. The next prime is 104902751. The reversal of 104902737 is 737209401.

It is not a de Polignac number, because 104902737 - 26 = 104902673 is a prime.

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

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

It is not an unprimeable number, because it can be changed into a prime (104902727) 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, 48162 + ... + 50292.

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

Almost surely, 2104902737 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2464.

The product of its (nonzero) digits is 10584, while the sum is 33.

The square root of 104902737 is about 10242.2037179505. The cubic root of 104902737 is about 471.6236841191.

The spelling of 104902737 in words is "one hundred four million, nine hundred two thousand, seven hundred thirty-seven".

Divisors: 1 3 61 183 269 807 2131 6393 16409 49227 129991 389973 573239 1719717 34967579 104902737