Base | Representation |
---|---|
bin | 11111111000110000110010… |
… | …000000000000010110000001 |
3 | 200101112211020110110201100001 |
4 | 133320300302000000112001 |
5 | 121340143221404324301 |
6 | 1214133230111200001 |
7 | 41353004454146515 |
oct | 3770606200002601 |
9 | 611484213421301 |
10 | 140240111011201 |
11 | 40759551682883 |
12 | 1388b581516001 |
13 | 603377caac816 |
14 | 268b92c5d6145 |
15 | 1132e79074c01 |
hex | 7f8c32000581 |
140240111011201 has 8 divisors (see below), whose sum is σ = 144030538183104. Its totient is φ = 136449691939440.
The previous prime is 140240111011171. The next prime is 140240111011241. The reversal of 140240111011201 is 102110111042041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 140240111011201 - 211 = 140240111009153 is a prime.
It is not an unprimeable number, because it can be changed into a prime (140240111011241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53019846 + ... + 55602016.
It is an arithmetic number, because the mean of its divisors is an integer number (18003817272888).
Almost surely, 2140240111011201 is an apocalyptic number.
It is an amenable number.
140240111011201 is a deficient number, since it is larger than the sum of its proper divisors (3790427171903).
140240111011201 is a wasteful number, since it uses less digits than its factorization.
140240111011201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4050071.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 140240111011201 its reverse (102110111042041), we get a palindrome (242350222053242).
The spelling of 140240111011201 in words is "one hundred forty trillion, two hundred forty billion, one hundred eleven million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •