Base | Representation |
---|---|
bin | 1001101110010… |
… | …00001010101000 |
3 | 12200110200121100 |
4 | 10313020022220 |
5 | 131334411412 |
6 | 12032041400 |
7 | 2010151635 |
oct | 467101250 |
9 | 180420540 |
10 | 81560232 |
11 | 42047456 |
12 | 23393260 |
13 | 13b885c0 |
14 | ab9118c |
15 | 7260edc |
hex | 4dc82a8 |
81560232 has 96 divisors (see below), whose sum is σ = 241113600. Its totient is φ = 24755328.
The previous prime is 81560201. The next prime is 81560249. The reversal of 81560232 is 23206518.
81560232 is a `hidden beast` number, since 81 + 560 + 23 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 81560196 and 81560205.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 73393 + ... + 74495.
It is an arithmetic number, because the mean of its divisors is an integer number (2511600).
Almost surely, 281560232 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 81560232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120556800).
81560232 is an abundant number, since it is smaller than the sum of its proper divisors (159553368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
81560232 is a wasteful number, since it uses less digits than its factorization.
81560232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1207 (or 1200 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The square root of 81560232 is about 9031.0703684558. The cubic root of 81560232 is about 433.6701040184.
The spelling of 81560232 in words is "eighty-one million, five hundred sixty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •