Base | Representation |
---|---|
bin | 11110100000101101… |
… | …010011000001000000 |
3 | 10010120011121020100101 |
4 | 132200231103001000 |
5 | 1014043304000000 |
6 | 23014501532144 |
7 | 2236563622351 |
oct | 364055230100 |
9 | 103504536311 |
10 | 32761000000 |
11 | 12991804213 |
12 | 6423714054 |
13 | 31213b8a01 |
14 | 182add9d28 |
15 | cbb20ce6a |
hex | 7a0b53040 |
32761000000 has 147 divisors (see below), whose sum is σ = 81713036091. Its totient is φ = 13032000000.
The previous prime is 32760999979. The next prime is 32761000049. The reversal of 32761000000 is 16723.
The square root of 32761000000 is 181000.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 10 ways, for example, as 6584348736 + 26176651264 = 81144^2 + 161792^2 .
It is a Duffinian 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 20 ways as a sum of consecutive naturals, for example, 180999910 + ... + 181000090.
Almost surely, 232761000000 is an apocalyptic number.
32761000000 is the 181000-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 32761000000
32761000000 is an abundant number, since it is smaller than the sum of its proper divisors (48952036091).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32761000000 is an frugal number, since it uses more digits than its factorization.
32761000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404 (or 188 counting only the distinct ones).
The product of its (nonzero) digits is 252, while the sum is 19.
Adding to 32761000000 its reverse (16723), we get a palindrome (32761016723).
The spelling of 32761000000 in words is "thirty-two billion, seven hundred sixty-one million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •