Base | Representation |
---|---|
bin | 111111110100000100… |
… | …1001000000100100001 |
3 | 111002201110110212201212 |
4 | 1333220021020010201 |
5 | 4221123401131031 |
6 | 142542114435505 |
7 | 12620642445104 |
oct | 1775011100441 |
9 | 432643425655 |
10 | 137038692641 |
11 | 53132851094 |
12 | 22685b92b95 |
13 | cbcc207216 |
14 | 68c021873b |
15 | 3870c7212b |
hex | 1fe8248121 |
137038692641 has 2 divisors, whose sum is σ = 137038692642. Its totient is φ = 137038692640.
The previous prime is 137038692631. The next prime is 137038692653. The reversal of 137038692641 is 146296830731.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95298159616 + 41740533025 = 308704^2 + 204305^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-137038692641 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 137038692641.
It is not a weakly prime, because it can be changed into another prime (137038692631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68519346320 + 68519346321.
It is an arithmetic number, because the mean of its divisors is an integer number (68519346321).
Almost surely, 2137038692641 is an apocalyptic number.
It is an amenable number.
137038692641 is a deficient number, since it is larger than the sum of its proper divisors (1).
137038692641 is an equidigital number, since it uses as much as digits as its factorization.
137038692641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1306368, while the sum is 50.
The spelling of 137038692641 in words is "one hundred thirty-seven billion, thirty-eight million, six hundred ninety-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •