Base | Representation |
---|---|
bin | 100101111110100011… |
… | …0000101110100100000 |
3 | 21210111202022221221120 |
4 | 1023331012011310200 |
5 | 2314011221044210 |
6 | 101244404252240 |
7 | 5615011350630 |
oct | 1137506056440 |
9 | 253452287846 |
10 | 81555643680 |
11 | 31651042215 |
12 | 139809a1080 |
13 | 78c950a234 |
14 | 3d396046c0 |
15 | 21c4d5a270 |
hex | 12fd185d20 |
81555643680 has 384 divisors, whose sum is σ = 300058214400. Its totient is φ = 18235736064.
The previous prime is 81555643661. The next prime is 81555643691. The reversal of 81555643680 is 8634655518.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 29993361 + ... + 29996079.
It is an arithmetic number, because the mean of its divisors is an integer number (781401600).
Almost surely, 281555643680 is an apocalyptic number.
81555643680 is a gapful number since it is divisible by the number (80) 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 81555643680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150029107200).
81555643680 is an abundant number, since it is smaller than the sum of its proper divisors (218502570720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
81555643680 is a wasteful number, since it uses less digits than its factorization.
81555643680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2936 (or 2928 counting only the distinct ones).
The product of its (nonzero) digits is 3456000, while the sum is 51.
The spelling of 81555643680 in words is "eighty-one billion, five hundred fifty-five million, six hundred forty-three thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •