Base | Representation |
---|---|
bin | 1001101010010… |
… | …00010000000000 |
3 | 12122111001220000 |
4 | 10311020100000 |
5 | 131221130123 |
6 | 12012520000 |
7 | 2002540254 |
oct | 465102000 |
9 | 178431800 |
10 | 81036288 |
11 | 41819843 |
12 | 23180000 |
13 | 13a33c88 |
14 | aa96264 |
15 | 71aab43 |
hex | 4d48400 |
81036288 has 110 divisors (see below), whose sum is σ = 242237886. Its totient is φ = 26984448.
The previous prime is 81036283. The next prime is 81036359. The reversal of 81036288 is 88263018.
It can be written as a sum of positive squares in only one way, i.e., 79709184 + 1327104 = 8928^2 + 1152^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (81036281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 82456 + ... + 83432.
Almost surely, 281036288 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 81036288, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (121118943).
81036288 is an abundant number, since it is smaller than the sum of its proper divisors (161201598).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
81036288 is an equidigital number, since it uses as much as digits as its factorization.
81036288 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1009 (or 982 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 36.
The square root of 81036288 is about 9002.0157742586. The cubic root of 81036288 is about 432.7394742265.
The spelling of 81036288 in words is "eighty-one million, thirty-six thousand, two hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •