Base | Representation |
---|---|
bin | 111111111100101000… |
… | …0001001100110011001 |
3 | 111010110110121201201102 |
4 | 1333321100021212121 |
5 | 4222220342342320 |
6 | 143030411201145 |
7 | 12631026405056 |
oct | 1777120114631 |
9 | 433413551642 |
10 | 137325746585 |
11 | 5326a892a55 |
12 | 227461461b5 |
13 | cc46821521 |
14 | 690a3bc02d |
15 | 388b075175 |
hex | 1ff9409999 |
137325746585 has 4 divisors (see below), whose sum is σ = 164790895908. Its totient is φ = 109860597264.
The previous prime is 137325746563. The next prime is 137325746599. The reversal of 137325746585 is 585647523731.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 585647523731 = 439 ⋅1334049029.
It can be written as a sum of positive squares in 2 ways, for example, as 14803345561 + 122522401024 = 121669^2 + 350032^2 .
It is a cyclic number.
It is not a de Polignac number, because 137325746585 - 222 = 137321552281 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 137325746585.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13732574654 + ... + 13732574663.
It is an arithmetic number, because the mean of its divisors is an integer number (41197723977).
Almost surely, 2137325746585 is an apocalyptic number.
It is an amenable number.
137325746585 is a deficient number, since it is larger than the sum of its proper divisors (27465149323).
137325746585 is an equidigital number, since it uses as much as digits as its factorization.
137325746585 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27465149322.
The product of its digits is 21168000, while the sum is 56.
The spelling of 137325746585 in words is "one hundred thirty-seven billion, three hundred twenty-five million, seven hundred forty-six thousand, five hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •