Base | Representation |
---|---|
bin | 11111110110110010010100… |
… | …010000000110011011101110 |
3 | 200101001211201222120012000121 |
4 | 133312302110100012123232 |
5 | 121330432122013203032 |
6 | 1213551011500115154 |
7 | 41340126445316455 |
oct | 3766622420063356 |
9 | 611054658505017 |
10 | 140104320444142 |
11 | 407069aa418a3a |
12 | 138691a5535aba |
13 | 6023a1c349c62 |
14 | 268512a077b9c |
15 | 112e67cb97a97 |
hex | 7f6c944066ee |
140104320444142 has 8 divisors (see below), whose sum is σ = 210156579639000. Its totient is φ = 70052127231144.
The previous prime is 140104320444133. The next prime is 140104320444149. The reversal of 140104320444142 is 241444023401041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1401043204441422 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 140104320444098 and 140104320444107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140104320444149) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10792717 + ... + 19917112.
It is an arithmetic number, because the mean of its divisors is an integer number (26269572454875).
Almost surely, 2140104320444142 is an apocalyptic number.
140104320444142 is a deficient number, since it is larger than the sum of its proper divisors (70052259194858).
140104320444142 is a wasteful number, since it uses less digits than its factorization.
140104320444142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32990930.
The product of its (nonzero) digits is 49152, while the sum is 34.
Adding to 140104320444142 its reverse (241444023401041), we get a palindrome (381548343845183).
The spelling of 140104320444142 in words is "one hundred forty trillion, one hundred four billion, three hundred twenty million, four hundred forty-four thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •