Base | Representation |
---|---|
bin | 10000100001110… |
… | …10110001010001 |
3 | 100122220021211011 |
4 | 20100322301101 |
5 | 240443342003 |
6 | 21431450521 |
7 | 3302346301 |
oct | 1020726121 |
9 | 318807734 |
10 | 138652753 |
11 | 712a1958 |
12 | 3a526a41 |
13 | 22958065 |
14 | 145b3601 |
15 | c28c46d |
hex | 843ac51 |
138652753 has 4 divisors (see below), whose sum is σ = 139454388. Its totient is φ = 137851120.
The previous prime is 138652751. The next prime is 138652757. The reversal of 138652753 is 357256831.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 357256831 = 1901 ⋅187931.
It can be written as a sum of positive squares in 2 ways, for example, as 109998144 + 28654609 = 10488^2 + 5353^2 .
It is a cyclic number.
It is not a de Polignac number, because 138652753 - 21 = 138652751 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (138652751) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 400558 + ... + 400903.
It is an arithmetic number, because the mean of its divisors is an integer number (34863597).
Almost surely, 2138652753 is an apocalyptic number.
It is an amenable number.
138652753 is a deficient number, since it is larger than the sum of its proper divisors (801635).
138652753 is an equidigital number, since it uses as much as digits as its factorization.
138652753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 801634.
The product of its digits is 151200, while the sum is 40.
The square root of 138652753 is about 11775.0903605875. The cubic root of 138652753 is about 517.5784261951.
The spelling of 138652753 in words is "one hundred thirty-eight million, six hundred fifty-two thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •