Base | Representation |
---|---|
bin | 11111111100111111111011… |
… | …100110100001011101001111 |
3 | 200102120122201212101112222211 |
4 | 133330333323212201131033 |
5 | 121404431003032400201 |
6 | 1214515100125451251 |
7 | 41413022350662046 |
oct | 3774777346413517 |
9 | 612518655345884 |
10 | 140531256137551 |
11 | 40860a754a1484 |
12 | 13917a95410b27 |
13 | 605506b241906 |
14 | 269ba6b6dd55d |
15 | 113a819172651 |
hex | 7fcffb9a174f |
140531256137551 has 8 divisors (see below), whose sum is σ = 145781111649600. Its totient is φ = 135368175096960.
The previous prime is 140531256137533. The next prime is 140531256137567. The reversal of 140531256137551 is 155731652135041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 140531256137551 - 215 = 140531256104783 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140531256137495 and 140531256137504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140531256132551) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21693614566 + ... + 21693621043.
It is an arithmetic number, because the mean of its divisors is an integer number (18222638956200).
Almost surely, 2140531256137551 is an apocalyptic number.
140531256137551 is a deficient number, since it is larger than the sum of its proper divisors (5249855512049).
140531256137551 is an equidigital number, since it uses as much as digits as its factorization.
140531256137551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43387235729.
The product of its (nonzero) digits is 1890000, while the sum is 49.
The spelling of 140531256137551 in words is "one hundred forty trillion, five hundred thirty-one billion, two hundred fifty-six million, one hundred thirty-seven thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •