Search a number
-
+
139090670 = 2529479623
BaseRepresentation
bin10000100101001…
…01101011101110
3100200201112112022
420102211223232
5241101400140
621445110142
73306152105
oct1022455356
9320645468
10139090670
1171570974
123a6b8352
1322a7c494
141468903c
15c3270b5
hex84a5aee

139090670 has 16 divisors (see below), whose sum is σ = 258996960. Its totient is φ = 53717664.

The previous prime is 139090669. The next prime is 139090687. The reversal of 139090670 is 76090931.

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

It is a Curzon number.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 239522 + ... + 240101.

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

Almost surely, 2139090670 is an apocalyptic number.

139090670 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 479659.

The product of its (nonzero) digits is 10206, while the sum is 35.

The square root of 139090670 is about 11793.6707602002. The cubic root of 139090670 is about 518.1227553022.

The spelling of 139090670 in words is "one hundred thirty-nine million, ninety thousand, six hundred seventy".

Divisors: 1 2 5 10 29 58 145 290 479623 959246 2398115 4796230 13909067 27818134 69545335 139090670