Base | Representation |
---|---|
bin | 11111110110101111010101… |
… | …100001000001111111011101 |
3 | 200101001112110222011211112200 |
4 | 133312233111201001333131 |
5 | 121330404043312343031 |
6 | 1213545322144522113 |
7 | 41336654240555316 |
oct | 3766572541017735 |
9 | 611045428154480 |
10 | 140101120434141 |
11 | 40705608069079 |
12 | 13868651920339 |
13 | 602362c3a6a09 |
14 | 2684d0508960d |
15 | 112e541c968e6 |
hex | 7f6bd5841fdd |
140101120434141 has 24 divisors (see below), whose sum is σ = 202621388919456. Its totient is φ = 93283937232480.
The previous prime is 140101120434133. The next prime is 140101120434221. The reversal of 140101120434141 is 141434021101041.
140101120434141 is a `hidden beast` number, since 1 + 4 + 0 + 101 + 120 + 434 + 1 + 4 + 1 = 666.
It is not a de Polignac number, because 140101120434141 - 23 = 140101120434133 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140101120434101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 238541346 + ... + 239127948.
It is an arithmetic number, because the mean of its divisors is an integer number (8442557871644).
Almost surely, 2140101120434141 is an apocalyptic number.
It is an amenable number.
140101120434141 is a deficient number, since it is larger than the sum of its proper divisors (62520268485315).
140101120434141 is a wasteful number, since it uses less digits than its factorization.
140101120434141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 619753 (or 619750 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
Adding to 140101120434141 its reverse (141434021101041), we get a palindrome (281535141535182).
The spelling of 140101120434141 in words is "one hundred forty trillion, one hundred one billion, one hundred twenty million, four hundred thirty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •