Base | Representation |
---|---|
bin | 11111110101111000101011… |
… | …010110101001010011001001 |
3 | 200100211220222210200011212211 |
4 | 133311320223112221103021 |
5 | 121323423344314304433 |
6 | 1213502334334505121 |
7 | 41332505663646421 |
oct | 3765705326512311 |
9 | 610756883604784 |
10 | 140042431009993 |
11 | 40692730452056 |
12 | 138591b29651a1 |
13 | 601ac383184c5 |
14 | 26821386ab481 |
15 | 112cc596228cd |
hex | 7f5e2b5a94c9 |
140042431009993 has 16 divisors (see below), whose sum is σ = 142067604042000. Its totient is φ = 138031102218240.
The previous prime is 140042431009973. The next prime is 140042431010023. The reversal of 140042431009993 is 399900134240041.
It can be written as a sum of positive squares in 8 ways, for example, as 47856067524864 + 92186363485129 = 6917808^2 + 9601373^2 .
It is a cyclic number.
It is not a de Polignac number, because 140042431009993 - 241 = 137843407754441 is a prime.
It is a super-2 number, since 2×1400424310099932 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (140042431009973) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 622660963 + ... + 622885831.
It is an arithmetic number, because the mean of its divisors is an integer number (8879225252625).
Almost surely, 2140042431009993 is an apocalyptic number.
It is an amenable number.
140042431009993 is a deficient number, since it is larger than the sum of its proper divisors (2025173032007).
140042431009993 is a wasteful number, since it uses less digits than its factorization.
140042431009993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255612.
The product of its (nonzero) digits is 839808, while the sum is 49.
The spelling of 140042431009993 in words is "one hundred forty trillion, forty-two billion, four hundred thirty-one million, nine thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •