Base | Representation |
---|---|
bin | 11111110101111000101011… |
… | …010110101001010011111010 |
3 | 200100211220222210200011221122 |
4 | 133311320223112221103322 |
5 | 121323423344314310132 |
6 | 1213502334334505242 |
7 | 41332505663646521 |
oct | 3765705326512372 |
9 | 610756883604848 |
10 | 140042431010042 |
11 | 406927304520a0 |
12 | 138591b2965222 |
13 | 601ac38318532 |
14 | 26821386ab4b8 |
15 | 112cc59622912 |
hex | 7f5e2b5a94fa |
140042431010042 has 16 divisors (see below), whose sum is σ = 229217332680864. Its totient is φ = 63639819618000.
The previous prime is 140042431010023. The next prime is 140042431010047. The reversal of 140042431010042 is 240010134240041.
It is a super-2 number, since 2×1400424310100422 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 140042431009993 and 140042431010020.
It is not an unprimeable number, because it can be changed into a prime (140042431010047) 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 7 ways as a sum of consecutive naturals, for example, 791451584 + ... + 791628507.
It is an arithmetic number, because the mean of its divisors is an integer number (14326083292554).
Almost surely, 2140042431010042 is an apocalyptic number.
140042431010042 is a deficient number, since it is larger than the sum of its proper divisors (89174901670822).
140042431010042 is a wasteful number, since it uses less digits than its factorization.
140042431010042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1583084125.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 140042431010042 its reverse (240010134240041), we get a palindrome (380052565250083).
The spelling of 140042431010042 in words is "one hundred forty trillion, forty-two billion, four hundred thirty-one million, ten thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •