Base | Representation |
---|---|
bin | 1000000111000001110… |
… | …0101110001110011100 |
3 | 111022121211120022021012 |
4 | 2001300130232032130 |
5 | 4240314313443121 |
6 | 144001045354352 |
7 | 13031421321326 |
oct | 2016034561634 |
9 | 438554508235 |
10 | 139325531036 |
11 | 540a66a267a |
12 | 23003a089b8 |
13 | 101a4c21733 |
14 | 6a59c1c616 |
15 | 39568e3c5b |
hex | 207072e39c |
139325531036 has 24 divisors (see below), whose sum is σ = 245543131680. Its totient is φ = 69170760000.
The previous prime is 139325531021. The next prime is 139325531119. The reversal of 139325531036 is 630135523931.
It is a junction number, because it is equal to n+sod(n) for n = 139325530984 and 139325531002.
It is a congruent number.
It is an unprimeable number.
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, 1344686 + ... + 1444586.
It is an arithmetic number, because the mean of its divisors is an integer number (10230963820).
Almost surely, 2139325531036 is an apocalyptic number.
It is an amenable number.
139325531036 is a deficient number, since it is larger than the sum of its proper divisors (106217600644).
139325531036 is a wasteful number, since it uses less digits than its factorization.
139325531036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102365 (or 102363 counting only the distinct ones).
The product of its (nonzero) digits is 218700, while the sum is 41.
The spelling of 139325531036 in words is "one hundred thirty-nine billion, three hundred twenty-five million, five hundred thirty-one thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •