Base | Representation |
---|---|
bin | 11111111100101101000111… |
… | …011010011111011100000000 |
3 | 200102111201120220000210000010 |
4 | 133330231013122133130000 |
5 | 121404113114110343423 |
6 | 1214501515311024520 |
7 | 41411405612660454 |
oct | 3774550732373400 |
9 | 612451526023003 |
10 | 140511053215488 |
11 | 4085344847407a |
12 | 13913b9750b140 |
13 | 605319b7c8967 |
14 | 269aab24b4664 |
15 | 113a0356c1693 |
hex | 7fcb4769f700 |
140511053215488 has 288 divisors, whose sum is σ = 383674908943872. Its totient is φ = 45637924864000.
The previous prime is 140511053215471. The next prime is 140511053215499. The reversal of 140511053215488 is 884512350115041.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3100603006 + ... + 3100648322.
It is an arithmetic number, because the mean of its divisors is an integer number (1332204544944).
Almost surely, 2140511053215488 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 140511053215488, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (191837454471936).
140511053215488 is an abundant number, since it is smaller than the sum of its proper divisors (243163855728384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140511053215488 is a wasteful number, since it uses less digits than its factorization.
140511053215488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46071 (or 46057 counting only the distinct ones).
The product of its (nonzero) digits is 768000, while the sum is 48.
The spelling of 140511053215488 in words is "one hundred forty trillion, five hundred eleven billion, fifty-three million, two hundred fifteen thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •