Base | Representation |
---|---|
bin | 1000000010010100010… |
… | …0000011111111011101 |
3 | 111012100200201001200110 |
4 | 2000211010003333131 |
5 | 4230222024303024 |
6 | 143231345320233 |
7 | 12655163141145 |
oct | 2004504037735 |
9 | 435320631613 |
10 | 138060775389 |
11 | 53607787a79 |
12 | 22910336079 |
13 | 10032ba6804 |
14 | 6979c73925 |
15 | 38d0866629 |
hex | 2025103fdd |
138060775389 has 4 divisors (see below), whose sum is σ = 184081033856. Its totient is φ = 92040516924.
The previous prime is 138060775379. The next prime is 138060775393. The reversal of 138060775389 is 983577060831.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 983577060831 = 3 ⋅327859020277.
It is not a de Polignac number, because 138060775389 - 25 = 138060775357 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 (138060775379) 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 3 ways as a sum of consecutive naturals, for example, 23010129229 + ... + 23010129234.
It is an arithmetic number, because the mean of its divisors is an integer number (46020258464).
Almost surely, 2138060775389 is an apocalyptic number.
It is an amenable number.
138060775389 is a deficient number, since it is larger than the sum of its proper divisors (46020258467).
138060775389 is an equidigital number, since it uses as much as digits as its factorization.
138060775389 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46020258466.
The product of its (nonzero) digits is 7620480, while the sum is 57.
The spelling of 138060775389 in words is "one hundred thirty-eight billion, sixty million, seven hundred seventy-five thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •