Base | Representation |
---|---|
bin | 10000100101010… |
… | …00011111011101 |
3 | 100200202010022100 |
4 | 20102220133131 |
5 | 241102232143 |
6 | 21445235313 |
7 | 3306230460 |
oct | 1022503735 |
9 | 320663270 |
10 | 139102173 |
11 | 71579581 |
12 | 3a702b39 |
13 | 22a847a2 |
14 | 1468d2d7 |
15 | c32a6d3 |
hex | 84a87dd |
139102173 has 48 divisors (see below), whose sum is σ = 244940800. Its totient is φ = 74299680.
The previous prime is 139102169. The next prime is 139102181. The reversal of 139102173 is 371201931.
139102173 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 139102173 - 22 = 139102169 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139102133) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 93828 + ... + 95298.
Almost surely, 2139102173 is an apocalyptic number.
It is an amenable number.
139102173 is a deficient number, since it is larger than the sum of its proper divisors (105838627).
139102173 is a wasteful number, since it uses less digits than its factorization.
139102173 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1582 (or 1579 counting only the distinct ones).
The product of its (nonzero) digits is 1134, while the sum is 27.
The square root of 139102173 is about 11794.1584269502. The cubic root of 139102173 is about 518.1370380761.
The spelling of 139102173 in words is "one hundred thirty-nine million, one hundred two thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •