Base | Representation |
---|---|
bin | 111111001110100011… |
… | …1111011000111011000 |
3 | 110222110202012001022200 |
4 | 1332131013323013120 |
5 | 4211034200224412 |
6 | 142213154250200 |
7 | 12544520455500 |
oct | 1763507730730 |
9 | 428422161280 |
10 | 135780086232 |
11 | 526473564aa |
12 | 22394586960 |
13 | ca5b5331bb |
14 | 6800dd0a00 |
15 | 37ea50b9dc |
hex | 1f9d1fb1d8 |
135780086232 has 864 divisors, whose sum is σ = 492463857600. Its totient is φ = 33578883072.
The previous prime is 135780086201. The next prime is 135780086243. The reversal of 135780086232 is 232680087531.
135780086232 is a `hidden beast` number, since 13 + 5 + 7 + 8 + 0 + 0 + 8 + 623 + 2 = 666.
It is a congruent number.
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 215 ways as a sum of consecutive naturals, for example, 833006583 + ... + 833006745.
Almost surely, 2135780086232 is an apocalyptic number.
135780086232 is a gapful number since it is divisible by the number (12) 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 135780086232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (246231928800).
135780086232 is an abundant number, since it is smaller than the sum of its proper divisors (356683771368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135780086232 is a wasteful number, since it uses less digits than its factorization.
135780086232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285 (or 254 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 45.
The spelling of 135780086232 in words is "one hundred thirty-five billion, seven hundred eighty million, eighty-six thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •