Base | Representation |
---|---|
bin | 10000011101111… |
… | …10110011110101 |
3 | 100121221111022222 |
4 | 20032332303311 |
5 | 240331120023 |
6 | 21412532125 |
7 | 3265133066 |
oct | 1016766365 |
9 | 317844288 |
10 | 138145013 |
11 | 70a85436 |
12 | 3a321045 |
13 | 2280ac16 |
14 | 144c056d |
15 | c1dbcc8 |
hex | 83becf5 |
138145013 has 4 divisors (see below), whose sum is σ = 141878700. Its totient is φ = 134411328.
The previous prime is 138145003. The next prime is 138145027. The reversal of 138145013 is 310541831.
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 62837329 + 75307684 = 7927^2 + 8678^2 .
It is a cyclic number.
It is not a de Polignac number, because 138145013 - 24 = 138144997 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 (138145003) 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, 1866788 + ... + 1866861.
It is an arithmetic number, because the mean of its divisors is an integer number (35469675).
Almost surely, 2138145013 is an apocalyptic number.
It is an amenable number.
138145013 is a deficient number, since it is larger than the sum of its proper divisors (3733687).
138145013 is an equidigital number, since it uses as much as digits as its factorization.
138145013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3733686.
The product of its (nonzero) digits is 1440, while the sum is 26.
The square root of 138145013 is about 11753.5106670305. The cubic root of 138145013 is about 516.9458706441.
Adding to 138145013 its reverse (310541831), we get a palindrome (448686844).
The spelling of 138145013 in words is "one hundred thirty-eight million, one hundred forty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •