Base | Representation |
---|---|
bin | 1111000101010000… |
… | …00001000010000000 |
3 | 202220022010201011110 |
4 | 13202220001002000 |
5 | 113040324424341 |
6 | 3415245043320 |
7 | 404440166100 |
oct | 74250010200 |
9 | 22808121143 |
10 | 8097108096 |
11 | 3485674180 |
12 | 169b856540 |
13 | 9c06b352c |
14 | 56b545200 |
15 | 325ccd216 |
hex | 1e2a01080 |
8097108096 has 768 divisors, whose sum is σ = 30139776000. Its totient is φ = 1896652800.
The previous prime is 8097108091. The next prime is 8097108113. The reversal of 8097108096 is 6908017908.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8097108091) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 114043741 + ... + 114043811.
It is an arithmetic number, because the mean of its divisors is an integer number (39244500).
Almost surely, 28097108096 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 8097108096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15069888000).
8097108096 is an abundant number, since it is smaller than the sum of its proper divisors (22042667904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8097108096 is a wasteful number, since it uses less digits than its factorization.
8097108096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161 (or 142 counting only the distinct ones).
The product of its (nonzero) digits is 217728, while the sum is 48.
The square root of 8097108096 is about 89983.9324324071. The cubic root of 8097108096 is about 2008.0598173744.
The spelling of 8097108096 in words is "eight billion, ninety-seven million, one hundred eight thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •