Base | Representation |
---|---|
bin | 110010011000100101… |
… | …1011000001100000000 |
3 | 101100021120222022220021 |
4 | 1210301023120030000 |
5 | 3233043001424030 |
6 | 121412301223224 |
7 | 10550164303330 |
oct | 1446113301400 |
9 | 340246868807 |
10 | 108199248640 |
11 | 41983722a4a |
12 | 18b77861b14 |
13 | a284405b62 |
14 | 5345d930c0 |
15 | 2c33e9197a |
hex | 19312d8300 |
108199248640 has 144 divisors (see below), whose sum is σ = 296659782720. Its totient is φ = 37038735360.
The previous prime is 108199248637. The next prime is 108199248761. The reversal of 108199248640 is 46842991801.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5913426 + ... + 5931694.
It is an arithmetic number, because the mean of its divisors is an integer number (2060137380).
Almost surely, 2108199248640 is an apocalyptic number.
108199248640 is a gapful number since it is divisible by the number (10) 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 108199248640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148329891360).
108199248640 is an abundant number, since it is smaller than the sum of its proper divisors (188460534080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108199248640 is an equidigital number, since it uses as much as digits as its factorization.
108199248640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18958 (or 18944 counting only the distinct ones).
The product of its (nonzero) digits is 995328, while the sum is 52.
The spelling of 108199248640 in words is "one hundred eight billion, one hundred ninety-nine million, two hundred forty-eight thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •