Search a number
-
+
140254631131 = 181197740749
BaseRepresentation
bin1000001010011111010…
…0111101010011011011
3111102000120211110222211
42002213310331103123
54244220141144011
6144233155255551
713063432460056
oct2024764752333
9442016743884
10140254631131
11545330a029a
1223222baa5b7
13102c25665c4
146b07391a9d
1539ad26cb21
hex20a7d3d4db

140254631131 has 4 divisors (see below), whose sum is σ = 140262390000. Its totient is φ = 140246872264.

The previous prime is 140254631117. The next prime is 140254631137. The reversal of 140254631131 is 131136452041.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131136452041 = 718733778863.

It is a cyclic number.

It is not a de Polignac number, because 140254631131 - 27 = 140254631003 is a prime.

It is a super-2 number, since 2×1402546311312 (a number of 23 digits) contains 22 as substring.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 140254631093 and 140254631102.

It is not an unprimeable number, because it can be changed into a prime (140254631137) 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, 3852256 + ... + 3888493.

It is an arithmetic number, because the mean of its divisors is an integer number (35065597500).

Almost surely, 2140254631131 is an apocalyptic number.

140254631131 is a deficient number, since it is larger than the sum of its proper divisors (7758869).

140254631131 is an equidigital number, since it uses as much as digits as its factorization.

140254631131 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 7758868.

The product of its (nonzero) digits is 8640, while the sum is 31.

The spelling of 140254631131 in words is "one hundred forty billion, two hundred fifty-four million, six hundred thirty-one thousand, one hundred thirty-one".

Divisors: 1 18119 7740749 140254631131