Base | Representation |
---|---|
bin | 1000000101110110010… |
… | …0101011001010010101 |
3 | 111021210202200011112121 |
4 | 2001131210223022111 |
5 | 4234142231123113 |
6 | 143505414015541 |
7 | 13020524500612 |
oct | 2013544531225 |
9 | 437722604477 |
10 | 139008848533 |
11 | 53a539643a5 |
12 | 22b359475b1 |
13 | 10154432539 |
14 | 6a29b45509 |
15 | 3938bdbe8d |
hex | 205d92b295 |
139008848533 has 8 divisors (see below), whose sum is σ = 141673122360. Its totient is φ = 136369828800.
The previous prime is 139008848527. The next prime is 139008848567. The reversal of 139008848533 is 335848800931.
It can be written as a sum of positive squares in 4 ways, for example, as 46080203569 + 92928644964 = 214663^2 + 304842^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 139008848533 - 217 = 139008717461 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 (139008848833) 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 7 ways as a sum of consecutive naturals, for example, 6302410 + ... + 6324427.
It is an arithmetic number, because the mean of its divisors is an integer number (17709140295).
Almost surely, 2139008848533 is an apocalyptic number.
It is an amenable number.
139008848533 is a deficient number, since it is larger than the sum of its proper divisors (2664273827).
139008848533 is a wasteful number, since it uses less digits than its factorization.
139008848533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12627047.
The product of its (nonzero) digits is 2488320, while the sum is 52.
The spelling of 139008848533 in words is "one hundred thirty-nine billion, eight million, eight hundred forty-eight thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •