Base | Representation |
---|---|
bin | 1000001001111101000… |
… | …0000111001110110000 |
3 | 111101122120002210200110 |
4 | 2002133100013032300 |
5 | 4243421323122421 |
6 | 144211015421320 |
7 | 13060034523261 |
oct | 2023720071660 |
9 | 441576083613 |
10 | 140110754736 |
11 | 54469960887 |
12 | 231a2984840 |
13 | 1029b7cca44 |
14 | 6ad221c968 |
15 | 39a07eca76 |
hex | 209f4073b0 |
140110754736 has 80 divisors (see below), whose sum is σ = 369832472064. Its totient is φ = 45687812352.
The previous prime is 140110754713. The next prime is 140110754741. The reversal of 140110754736 is 637457011041.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 140110754694 and 140110754703.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5032791 + ... + 5060553.
Almost surely, 2140110754736 is an apocalyptic number.
140110754736 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 140110754736, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (184916236032).
140110754736 is an abundant number, since it is smaller than the sum of its proper divisors (229721717328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140110754736 is a wasteful number, since it uses less digits than its factorization.
140110754736 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30058 (or 30052 counting only the distinct ones).
The product of its (nonzero) digits is 70560, while the sum is 39.
Adding to 140110754736 its reverse (637457011041), we get a palindrome (777567765777).
The spelling of 140110754736 in words is "one hundred forty billion, one hundred ten million, seven hundred fifty-four thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •