| Base | Representation |
|---|---|
| bin | 11110101101010011110000… |
| … | …011101100001110000000000 |
| 3 | 122201012010112011211221210000 |
| 4 | 132231103300131201300000 |
| 5 | 120200220102344141210 |
| 6 | 1155123223133440000 |
| 7 | 40306254311143650 |
| oct | 3655236035416000 |
| 9 | 581163464757700 |
| 10 | 135054985927680 |
| 11 | 3a03a552753025 |
| 12 | 13192689640000 |
| 13 | 5a4882735b720 |
| 14 | 254c9a6512360 |
| 15 | 1093154236ac0 |
| hex | 7ad4f0761c00 |
135054985927680 has 3520 divisors, whose sum is σ = 618698506567680. Its totient is φ = 27404166758400.
The previous prime is 135054985927639. The next prime is 135054985927717. The reversal of 135054985927680 is 86729589450531.
135054985927680 is a `hidden beast` number, since 1 + 3 + 5 + 0 + 5 + 498 + 59 + 2 + 7 + 6 + 80 = 666.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a junction number, because it is equal to n+sod(n) for n = 135054985927599 and 135054985927608.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 319 ways as a sum of consecutive naturals, for example, 281951953681 + ... + 281951954159.
It is an arithmetic number, because the mean of its divisors is an integer number (175766621184).
It is a 1-persistent number, because it is pandigital, but 2⋅135054985927680 = 270109971855360 is not.
Almost surely, 2135054985927680 is an apocalyptic number.
135054985927680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 135054985927680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (309349253283840).
135054985927680 is an abundant number, since it is smaller than the sum of its proper divisors (483643520640000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135054985927680 is a wasteful number, since it uses less digits than its factorization.
135054985927680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 808 (or 781 counting only the distinct ones).
The product of its (nonzero) digits is 653184000, while the sum is 72.
The spelling of 135054985927680 in words is "one hundred thirty-five trillion, fifty-four billion, nine hundred eighty-five million, nine hundred twenty-seven thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •