Base | Representation |
---|---|
bin | 10000011101111… |
… | …10011111100101 |
3 | 100121221102112222 |
4 | 20032332133211 |
5 | 240331044332 |
6 | 21412522125 |
7 | 3265126235 |
oct | 1016763745 |
9 | 317842488 |
10 | 138143717 |
11 | 70a84468 |
12 | 3a320345 |
13 | 2280a45a |
14 | 144bdcc5 |
15 | c1db712 |
hex | 83be7e5 |
138143717 has 4 divisors (see below), whose sum is σ = 146269836. Its totient is φ = 130017600.
The previous prime is 138143713. The next prime is 138143723. The reversal of 138143717 is 717341831.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 82283041 + 55860676 = 9071^2 + 7474^2 .
It is a cyclic number.
It is not a de Polignac number, because 138143717 - 22 = 138143713 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138143713) 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, 4063034 + ... + 4063067.
It is an arithmetic number, because the mean of its divisors is an integer number (36567459).
Almost surely, 2138143717 is an apocalyptic number.
138143717 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
138143717 is a deficient number, since it is larger than the sum of its proper divisors (8126119).
138143717 is an equidigital number, since it uses as much as digits as its factorization.
138143717 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8126118.
The product of its digits is 14112, while the sum is 35.
The square root of 138143717 is about 11753.4555344375. The cubic root of 138143717 is about 516.9442540724.
The spelling of 138143717 in words is "one hundred thirty-eight million, one hundred forty-three thousand, seven hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •