Base | Representation |
---|---|
bin | 11110110101100101111010… |
… | …111110011110011000000001 |
3 | 122210012112212212011122211221 |
4 | 132311211322332132120001 |
5 | 120234031423322102424 |
6 | 1200240530202035041 |
7 | 40365346143536011 |
oct | 3665457276363001 |
9 | 583175785148757 |
10 | 135624245503489 |
11 | 3a239a12962976 |
12 | 13264a794a8a81 |
13 | 5a8a4083ccb02 |
14 | 256c369c8dc41 |
15 | 10a2d704709e4 |
hex | 7b597af9e601 |
135624245503489 has 8 divisors (see below), whose sum is σ = 135889406965760. Its totient is φ = 135359332672176.
The previous prime is 135624245503477. The next prime is 135624245503507. The reversal of 135624245503489 is 984305542426531.
It is a happy number.
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 135624245503489 - 27 = 135624245503361 is a prime.
It is a super-2 number, since 2×1356242455034892 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135624245503289) 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, 61065687 + ... + 63247660.
It is an arithmetic number, because the mean of its divisors is an integer number (16986175870720).
Almost surely, 2135624245503489 is an apocalyptic number.
It is an amenable number.
135624245503489 is a deficient number, since it is larger than the sum of its proper divisors (265161462271).
135624245503489 is a wasteful number, since it uses less digits than its factorization.
135624245503489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124315479.
The product of its (nonzero) digits is 124416000, while the sum is 61.
The spelling of 135624245503489 in words is "one hundred thirty-five trillion, six hundred twenty-four billion, two hundred forty-five million, five hundred three thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •