Base | Representation |
---|---|
bin | 11111001101010011000010… |
… | …000101011111000100110111 |
3 | 122222222021120200000110211121 |
4 | 133031103002011133010313 |
5 | 120442224104132111022 |
6 | 1203525133001244411 |
7 | 40624135006101406 |
oct | 3715230205370467 |
9 | 588867520013747 |
10 | 137253231128887 |
11 | 3a80784a873775 |
12 | 13488719493707 |
13 | 5b77c024b9c83 |
14 | 25c713ddb563d |
15 | 10d04115ad2c7 |
hex | 7cd4c215f137 |
137253231128887 has 8 divisors (see below), whose sum is σ = 137651919895296. Its totient is φ = 136854560445432.
The previous prime is 137253231128863. The next prime is 137253231128911. The reversal of 137253231128887 is 788821132352731.
It is an interprime number because it is at equal distance from previous prime (137253231128863) and next prime (137253231128911).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-137253231128887 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137253231128837) 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, 10756578 + ... + 19753744.
It is an arithmetic number, because the mean of its divisors is an integer number (17206489986912).
Almost surely, 2137253231128887 is an apocalyptic number.
137253231128887 is a deficient number, since it is larger than the sum of its proper divisors (398688766409).
137253231128887 is an equidigital number, since it uses as much as digits as its factorization.
137253231128887 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9041477.
The product of its digits is 27095040, while the sum is 61.
The spelling of 137253231128887 in words is "one hundred thirty-seven trillion, two hundred fifty-three billion, two hundred thirty-one million, one hundred twenty-eight thousand, eight hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •