Base | Representation |
---|---|
bin | 1000000100111000100… |
… | …1010110011101110111 |
3 | 111021010201122201000120 |
4 | 2001032021112131313 |
5 | 4233130001341024 |
6 | 143424010343023 |
7 | 13011232530006 |
oct | 2011611263567 |
9 | 437121581016 |
10 | 138750027639 |
11 | 53930856433 |
12 | 22a8312aa73 |
13 | 10112921b92 |
14 | 6a03610c3d |
15 | 3921114479 |
hex | 204e256777 |
138750027639 has 8 divisors (see below), whose sum is σ = 190000038000. Its totient is φ = 90000017856.
The previous prime is 138750027629. The next prime is 138750027643. The reversal of 138750027639 is 936720057831.
138750027639 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 138750027639 - 24 = 138750027623 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 138750027591 and 138750027600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138750027629) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 625000014 + ... + 625000235.
It is an arithmetic number, because the mean of its divisors is an integer number (23750004750).
Almost surely, 2138750027639 is an apocalyptic number.
138750027639 is a deficient number, since it is larger than the sum of its proper divisors (51250010361).
138750027639 is a wasteful number, since it uses less digits than its factorization.
138750027639 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1250000289.
The product of its (nonzero) digits is 1905120, while the sum is 51.
The spelling of 138750027639 in words is "one hundred thirty-eight billion, seven hundred fifty million, twenty-seven thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •