Base | Representation |
---|---|
bin | 10000100110111… |
… | …11111001100111 |
3 | 100201011122122001 |
4 | 20103133321213 |
5 | 241132013002 |
6 | 21454150131 |
7 | 3311164240 |
oct | 1023377147 |
9 | 321148561 |
10 | 139329127 |
11 | 71714043 |
12 | 3a7b2347 |
13 | 22b33b92 |
14 | 1470bcc7 |
15 | c372a87 |
hex | 84dfe67 |
139329127 has 8 divisors (see below), whose sum is σ = 168600096. Its totient is φ = 112399872.
The previous prime is 139329121. The next prime is 139329143. The reversal of 139329127 is 721923931.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 139329127 - 23 = 139329119 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139329121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 585298 + ... + 585535.
It is an arithmetic number, because the mean of its divisors is an integer number (21075012).
Almost surely, 2139329127 is an apocalyptic number.
139329127 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
139329127 is a deficient number, since it is larger than the sum of its proper divisors (29270969).
139329127 is a wasteful number, since it uses less digits than its factorization.
139329127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1170857.
The product of its digits is 20412, while the sum is 37.
The square root of 139329127 is about 11803.7759636482. The cubic root of 139329127 is about 518.4186760862.
It can be divided in two parts, 139 and 329127, that added together give a triangular number (329266 = T811).
The spelling of 139329127 in words is "one hundred thirty-nine million, three hundred twenty-nine thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •