Base | Representation |
---|---|
bin | 111110111001010001… |
… | …1001111001100000000 |
3 | 110220121222011212112210 |
4 | 1331302203033030000 |
5 | 4203103322413143 |
6 | 142014241222120 |
7 | 12521025402336 |
oct | 1756243171400 |
9 | 426558155483 |
10 | 135065826048 |
11 | 5231015722a |
12 | 22215331940 |
13 | c97657013a |
14 | 67741c3b56 |
15 | 37a796e033 |
hex | 1f728cf300 |
135065826048 has 72 divisors (see below), whose sum is σ = 360085658688. Its totient is φ = 44945093632.
The previous prime is 135065826011. The next prime is 135065826067. The reversal of 135065826048 is 840628560531.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 135065825988 and 135065826006.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 301015 + ... + 600617.
It is an arithmetic number, because the mean of its divisors is an integer number (5001189704).
Almost surely, 2135065826048 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 135065826048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (180042829344).
135065826048 is an abundant number, since it is smaller than the sum of its proper divisors (225019832640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135065826048 is an equidigital number, since it uses as much as digits as its factorization.
135065826048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 300209 (or 300195 counting only the distinct ones).
The product of its (nonzero) digits is 1382400, while the sum is 48.
The spelling of 135065826048 in words is "one hundred thirty-five billion, sixty-five million, eight hundred twenty-six thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •