Base | Representation |
---|---|
bin | 1000000110000111110… |
… | …1110111001100100101 |
3 | 111021222220101010001210 |
4 | 2001201331313030211 |
5 | 4234320113412133 |
6 | 143521005542033 |
7 | 13022411153655 |
oct | 2014175671445 |
9 | 437886333053 |
10 | 139082560293 |
11 | 53a91530106 |
12 | 22b56574919 |
13 | 101667a0671 |
14 | 6a35852365 |
15 | 39403ec763 |
hex | 2061f77325 |
139082560293 has 8 divisors (see below), whose sum is σ = 191425459456. Its totient is φ = 89730684000.
The previous prime is 139082560289. The next prime is 139082560319. The reversal of 139082560293 is 392065280931.
139082560293 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 139082560293 - 22 = 139082560289 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 (139082560213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 747755608 + ... + 747755793.
It is an arithmetic number, because the mean of its divisors is an integer number (23928182432).
Almost surely, 2139082560293 is an apocalyptic number.
It is an amenable number.
139082560293 is a deficient number, since it is larger than the sum of its proper divisors (52342899163).
139082560293 is a wasteful number, since it uses less digits than its factorization.
139082560293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1495511435.
The product of its (nonzero) digits is 699840, while the sum is 48.
The spelling of 139082560293 in words is "one hundred thirty-nine billion, eighty-two million, five hundred sixty thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •