Base | Representation |
---|---|
bin | 11111111100100100001111… |
… | …111111110101000001101001 |
3 | 200102110211000110002101111010 |
4 | 133330210033333311001221 |
5 | 121403434120041411203 |
6 | 1214453302523254133 |
7 | 41410620660054006 |
oct | 3774441777650151 |
9 | 612424013071433 |
10 | 140501533544553 |
11 | 4084a402900435 |
12 | 1391217b37a349 |
13 | 6052312496b8c |
14 | 269a44c0668ad |
15 | 1139b79a93303 |
hex | 7fc90fff5069 |
140501533544553 has 16 divisors (see below), whose sum is σ = 187518894509120. Its totient is φ = 93575949041664.
The previous prime is 140501533544441. The next prime is 140501533544591. The reversal of 140501533544553 is 355445335105041.
It is not a de Polignac number, because 140501533544553 - 210 = 140501533543529 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140501533544353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28610850 + ... + 33159972.
It is an arithmetic number, because the mean of its divisors is an integer number (11719930906820).
Almost surely, 2140501533544553 is an apocalyptic number.
It is an amenable number.
140501533544553 is a deficient number, since it is larger than the sum of its proper divisors (47017360964567).
140501533544553 is a wasteful number, since it uses less digits than its factorization.
140501533544553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4559208.
The product of its (nonzero) digits is 5400000, while the sum is 48.
Adding to 140501533544553 its reverse (355445335105041), we get a palindrome (495946868649594).
The spelling of 140501533544553 in words is "one hundred forty trillion, five hundred one billion, five hundred thirty-three million, five hundred forty-four thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •