Base | Representation |
---|---|
bin | 11111111111110100100111… |
… | …110101000100001101011110 |
3 | 200110021012112010212002012120 |
4 | 133333310213311010031132 |
5 | 121421120324022110432 |
6 | 1215144144120043410 |
7 | 41433031263564405 |
oct | 3777644765041536 |
9 | 613235463762176 |
10 | 140725271675742 |
11 | 40926286184976 |
12 | 13949600903566 |
13 | 606a44a775610 |
14 | 26a71d4a9863c |
15 | 11408c202cc2c |
hex | 7ffd27d4435e |
140725271675742 has 128 divisors (see below), whose sum is σ = 316774488780288. Its totient is φ = 41394255552000.
The previous prime is 140725271675731. The next prime is 140725271675761. The reversal of 140725271675742 is 247576172527041.
It is a super-2 number, since 2×1407252716757422 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 36341973 + ... + 40027359.
It is an arithmetic number, because the mean of its divisors is an integer number (2474800693596).
Almost surely, 2140725271675742 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 140725271675742, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (158387244390144).
140725271675742 is an abundant number, since it is smaller than the sum of its proper divisors (176049217104546).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140725271675742 is a wasteful number, since it uses less digits than its factorization.
140725271675742 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3685674.
The product of its (nonzero) digits is 46099200, while the sum is 60.
The spelling of 140725271675742 in words is "one hundred forty trillion, seven hundred twenty-five billion, two hundred seventy-one million, six hundred seventy-five thousand, seven hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •