Base | Representation |
---|---|
bin | 11111111000011000100101… |
… | …011110111110101000000010 |
3 | 200101110100011212220201211210 |
4 | 133320120211132332220002 |
5 | 121334232020043114132 |
6 | 1214113252130150550 |
7 | 41351064611455062 |
oct | 3770304536765002 |
9 | 611410155821753 |
10 | 140214131223042 |
11 | 4074952a778478 |
12 | 13886530a22456 |
13 | 603119c594ac6 |
14 | 268a5860833a2 |
15 | 1132458364bcc |
hex | 7f86257bea02 |
140214131223042 has 8 divisors (see below), whose sum is σ = 280428262446096. Its totient is φ = 46738043741012.
The previous prime is 140214131223041. The next prime is 140214131223053. The reversal of 140214131223042 is 240322131412041.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
140214131223042 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (140214131223041) 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, 11684510935248 + ... + 11684510935259.
It is an arithmetic number, because the mean of its divisors is an integer number (35053532805762).
Almost surely, 2140214131223042 is an apocalyptic number.
140214131223042 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140214131223042 is a wasteful number, since it uses less digits than its factorization.
140214131223042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23369021870512.
The product of its (nonzero) digits is 9216, while the sum is 30.
Adding to 140214131223042 its reverse (240322131412041), we get a palindrome (380536262635083).
The spelling of 140214131223042 in words is "one hundred forty trillion, two hundred fourteen billion, one hundred thirty-one million, two hundred twenty-three thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •