Base | Representation |
---|---|
bin | 1000000100011010101… |
… | …0110101011100011001 |
3 | 111020210222121200120011 |
4 | 2001012222311130121 |
5 | 4232400343300140 |
6 | 143403330001521 |
7 | 13005150360313 |
oct | 2010652653431 |
9 | 436728550504 |
10 | 138624587545 |
11 | 53876a69434 |
12 | 22a491162a1 |
13 | 100c2941a82 |
14 | 69d0aba7b3 |
15 | 39150d6cea |
hex | 2046ab5719 |
138624587545 has 8 divisors (see below), whose sum is σ = 166637809224. Its totient is φ = 110707467264.
The previous prime is 138624587527. The next prime is 138624587561. The reversal of 138624587545 is 545785426831.
It can be written as a sum of positive squares in 4 ways, for example, as 13331242521 + 125293345024 = 115461^2 + 353968^2 .
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 138624587545 - 25 = 138624587513 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 138624587545.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24022174 + ... + 24027943.
It is an arithmetic number, because the mean of its divisors is an integer number (20829726153).
Almost surely, 2138624587545 is an apocalyptic number.
It is an amenable number.
138624587545 is a deficient number, since it is larger than the sum of its proper divisors (28013221679).
138624587545 is an equidigital number, since it uses as much as digits as its factorization.
138624587545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48050699.
The product of its digits is 32256000, while the sum is 58.
The spelling of 138624587545 in words is "one hundred thirty-eight billion, six hundred twenty-four million, five hundred eighty-seven thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.937 sec. • engine limits •