Base | Representation |
---|---|
bin | 1000000110001100000… |
… | …0000010010111000001 |
3 | 111022001010000102222201 |
4 | 2001203000002113001 |
5 | 4234334034020041 |
6 | 143522425433201 |
7 | 13023011463661 |
oct | 2014300022701 |
9 | 438033012881 |
10 | 139099907521 |
11 | 53aa02a9363 |
12 | 22b6033b801 |
13 | 1016a2654b3 |
14 | 6a37c8a1a1 |
15 | 3941bc7631 |
hex | 20630025c1 |
139099907521 has 27 divisors (see below), whose sum is σ = 147143028963. Its totient is φ = 131491130160.
The previous prime is 139099907503. The next prime is 139099907543. The reversal of 139099907521 is 125709990931.
The square root of 139099907521 is 372961.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 100276722225 + 38823185296 = 316665^2 + 197036^2 .
It is not a de Polignac number, because 139099907521 - 25 = 139099907489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (139093907521) 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 26 ways as a sum of consecutive naturals, for example, 612774810 + ... + 612775036.
Almost surely, 2139099907521 is an apocalyptic number.
139099907521 is the 372961-st square number.
139099907521 is the 186481-st centered octagonal number.
It is an amenable number.
139099907521 is a deficient number, since it is larger than the sum of its proper divisors (8043121442).
139099907521 is an frugal number, since it uses more digits than its factorization.
139099907521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 622 (or 311 counting only the distinct ones).
The product of its (nonzero) digits is 1377810, while the sum is 55.
The spelling of 139099907521 in words is "one hundred thirty-nine billion, ninety-nine million, nine hundred seven thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •