Base | Representation |
---|---|
bin | 1000000000011100101… |
… | …0010100101001100010 |
3 | 111011001201201022102120 |
4 | 2000013022110221202 |
5 | 4223210112200002 |
6 | 143105504525110 |
7 | 12636562025532 |
oct | 2000712245142 |
9 | 434051638376 |
10 | 137559100002 |
11 | 5337a586915 |
12 | 227b0320796 |
13 | cc82c85c7c |
14 | 692d3a34c2 |
15 | 38a17bbcbc |
hex | 2007294a62 |
137559100002 has 8 divisors (see below), whose sum is σ = 275118200016. Its totient is φ = 45853033332.
The previous prime is 137559099983. The next prime is 137559100031. The reversal of 137559100002 is 200001955731.
It is a sphenic number, since it is the product of 3 distinct primes.
137559100002 is an admirable number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11463258328 + ... + 11463258339.
It is an arithmetic number, because the mean of its divisors is an integer number (34389775002).
Almost surely, 2137559100002 is an apocalyptic number.
137559100002 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137559100002 is a wasteful number, since it uses less digits than its factorization.
137559100002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22926516672.
The product of its (nonzero) digits is 9450, while the sum is 33.
The spelling of 137559100002 in words is "one hundred thirty-seven billion, five hundred fifty-nine million, one hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •