Base | Representation |
---|---|
bin | 111111001101001000… |
… | …1010100000000000000 |
3 | 110222100102002222110000 |
4 | 1332122101110000000 |
5 | 4210434421401213 |
6 | 142204324240000 |
7 | 12543366540540 |
oct | 1763221240000 |
9 | 428312088400 |
10 | 135732215808 |
11 | 5262232a772 |
12 | 22380540000 |
13 | ca516421c7 |
14 | 67d88cd320 |
15 | 37e6202c73 |
hex | 1f9a454000 |
135732215808 has 600 divisors, whose sum is σ = 488464222400. Its totient is φ = 36691771392.
The previous prime is 135732215791. The next prime is 135732215833. The reversal of 135732215808 is 808512237531.
135732215808 is a `hidden beast` number, since 1 + 3 + 573 + 2 + 21 + 58 + 0 + 8 = 666.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 176504448 + ... + 176505216.
Almost surely, 2135732215808 is an apocalyptic number.
135732215808 is a gapful number since it is divisible by the number (18) 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 135732215808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (244232111200).
135732215808 is an abundant number, since it is smaller than the sum of its proper divisors (352732006592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135732215808 is an frugal number, since it uses more digits than its factorization.
135732215808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 835 (or 800 counting only the distinct ones).
The product of its (nonzero) digits is 403200, while the sum is 45.
The spelling of 135732215808 in words is "one hundred thirty-five billion, seven hundred thirty-two million, two hundred fifteen thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •