Base | Representation |
---|---|
bin | 11111111110111001100111… |
… | …100011010001010100110000 |
3 | 200110001010222210102122101210 |
4 | 133332321213203101110300 |
5 | 121414101101024240443 |
6 | 1215055105305200120 |
7 | 41425326261362601 |
oct | 3776714743212460 |
9 | 613033883378353 |
10 | 140661916243248 |
11 | 40901424741804 |
12 | 1393927b190040 |
13 | 6064491ac811a |
14 | 26a4104719da8 |
15 | 113de14e27c33 |
hex | 7fee678d1530 |
140661916243248 has 160 divisors (see below), whose sum is σ = 375465933572800. Its totient is φ = 45356539576320.
The previous prime is 140661916243243. The next prime is 140661916243313. The reversal of 140661916243248 is 842342619166041.
It is not an unprimeable number, because it can be changed into a prime (140661916243243) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 73653840 + ... + 75539472.
It is an arithmetic number, because the mean of its divisors is an integer number (2346662084830).
Almost surely, 2140661916243248 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 140661916243248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (187732966786400).
140661916243248 is an abundant number, since it is smaller than the sum of its proper divisors (234804017329552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140661916243248 is a wasteful number, since it uses less digits than its factorization.
140661916243248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1886127 (or 1886121 counting only the distinct ones).
The product of its (nonzero) digits is 11943936, while the sum is 57.
The spelling of 140661916243248 in words is "one hundred forty trillion, six hundred sixty-one billion, nine hundred sixteen million, two hundred forty-three thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •