Base | Representation |
---|---|
bin | 10010100101111011010111… |
… | …101101101110100100000000 |
3 | 101201112020202222022022021110 |
4 | 102211323113231232210000 |
5 | 41204214412324014023 |
6 | 445525101302123320 |
7 | 23136526503525435 |
oct | 2245732755564400 |
9 | 351466688268243 |
10 | 81771206469888 |
11 | 24066a79310451 |
12 | 9207983720540 |
13 | 3681cb7960630 |
14 | 1629a6724db8c |
15 | 96c0cb730a93 |
hex | 4a5ed7b6e900 |
81771206469888 has 864 divisors, whose sum is σ = 245910531484800. Its totient is φ = 23971759128576.
The previous prime is 81771206469871. The next prime is 81771206469913. The reversal of 81771206469888 is 88896460217718.
It is a super-2 number, since 2×817712064698882 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 210208756798 + ... + 210208757186.
It is an arithmetic number, because the mean of its divisors is an integer number (284618670700).
Almost surely, 281771206469888 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 81771206469888, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (122955265742400).
81771206469888 is an abundant number, since it is smaller than the sum of its proper divisors (164139325014912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
81771206469888 is a wasteful number, since it uses less digits than its factorization.
81771206469888 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 759 (or 702 counting only the distinct ones).
The product of its (nonzero) digits is 520224768, while the sum is 75.
The spelling of 81771206469888 in words is "eighty-one trillion, seven hundred seventy-one billion, two hundred six million, four hundred sixty-nine thousand, eight hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •