Base | Representation |
---|---|
bin | 11110110010011000000110… |
… | …001010111100010101010011 |
3 | 122202102102102210001010121011 |
4 | 132302120012022330111103 |
5 | 120221421320040134210 |
6 | 1155551220232511351 |
7 | 40343363401206613 |
oct | 3662300612742523 |
9 | 582372383033534 |
10 | 135403242505555 |
11 | 3a164213491542 |
12 | 1322a07bb4b557 |
13 | 5a7261798940b |
14 | 25617a25d8a43 |
15 | 109c2381aad8a |
hex | 7b26062bc553 |
135403242505555 has 8 divisors (see below), whose sum is σ = 163921801547232. Its totient is φ = 107363986977408.
The previous prime is 135403242505537. The next prime is 135403242505579. The reversal of 135403242505555 is 555505242304531.
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 135403242505555 - 29 = 135403242505043 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 135403242505499 and 135403242505508.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 119825877759 + ... + 119825878888.
It is an arithmetic number, because the mean of its divisors is an integer number (20490225193404).
Almost surely, 2135403242505555 is an apocalyptic number.
135403242505555 is a deficient number, since it is larger than the sum of its proper divisors (28518559041677).
135403242505555 is a wasteful number, since it uses less digits than its factorization.
135403242505555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239651756765.
The product of its (nonzero) digits is 9000000, while the sum is 49.
The spelling of 135403242505555 in words is "one hundred thirty-five trillion, four hundred three billion, two hundred forty-two million, five hundred five thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •