Base | Representation |
---|---|
bin | 10010011001111011111010… |
… | …001111000001001110000000 |
3 | 101121121110202012020212221001 |
4 | 102121323322033001032000 |
5 | 41102214231341322233 |
6 | 444054335212541344 |
7 | 23023144612340551 |
oct | 2231737217011600 |
9 | 347543665225831 |
10 | 80947151901568 |
11 | 23879548a62527 |
12 | 90b4125481854 |
13 | 362238c2c00a4 |
14 | 15dbc12326328 |
15 | 95594b76e27d |
hex | 499efa3c1380 |
80947151901568 has 256 divisors, whose sum is σ = 174123666662400. Its totient is φ = 37369092096000.
The previous prime is 80947151901557. The next prime is 80947151901589. The reversal of 80947151901568 is 86510915174908.
It is a Harshad number since it is a multiple of its sum of digits (64).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10688911030 + ... + 10688918602.
It is an arithmetic number, because the mean of its divisors is an integer number (680170572900).
Almost surely, 280947151901568 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 80947151901568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87061833331200).
80947151901568 is an abundant number, since it is smaller than the sum of its proper divisors (93176514760832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80947151901568 is a wasteful number, since it uses less digits than its factorization.
80947151901568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8381 (or 8369 counting only the distinct ones).
The product of its (nonzero) digits is 21772800, while the sum is 64.
The spelling of 80947151901568 in words is "eighty trillion, nine hundred forty-seven billion, one hundred fifty-one million, nine hundred one thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •