Base | Representation |
---|---|
bin | 10100000111000… |
… | …10100011101011 |
3 | 102202102212002022 |
4 | 22003202203223 |
5 | 321141401024 |
6 | 24423455055 |
7 | 4115633066 |
oct | 1203424353 |
9 | 382385068 |
10 | 168700139 |
11 | 87254a03 |
12 | 485b748b |
13 | 28c4878a |
14 | 185958dd |
15 | ec2535e |
hex | a0e28eb |
168700139 has 4 divisors (see below), whose sum is σ = 168726360. Its totient is φ = 168673920.
The previous prime is 168700093. The next prime is 168700141. The reversal of 168700139 is 931007861.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 931007861 = 7 ⋅133001123.
It is a cyclic number.
It is not a de Polignac number, because 168700139 - 212 = 168696043 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 168700099 and 168700108.
It is not an unprimeable number, because it can be changed into a prime (168705139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3884 + ... + 18774.
It is an arithmetic number, because the mean of its divisors is an integer number (42181590).
Almost surely, 2168700139 is an apocalyptic number.
168700139 is a deficient number, since it is larger than the sum of its proper divisors (26221).
168700139 is a wasteful number, since it uses less digits than its factorization.
168700139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26220.
The product of its (nonzero) digits is 9072, while the sum is 35.
The square root of 168700139 is about 12988.4617641967. The cubic root of 168700139 is about 552.5502929178.
The spelling of 168700139 in words is "one hundred sixty-eight million, seven hundred thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •