Base | Representation |
---|---|
bin | 11000101000001101000000… |
… | …010000001000010110100000 |
3 | 112012111220011101122101212002 |
4 | 120220031000100020112200 |
5 | 103144121334200130120 |
6 | 1022211341320223132 |
7 | 31546363640502161 |
oct | 3050150020102640 |
9 | 465456141571762 |
10 | 108315858208160 |
11 | 31570552196169 |
12 | 1019440990aaa8 |
13 | 48591ac138115 |
14 | 1ca67307b5768 |
15 | c7c82622c375 |
hex | 6283404085a0 |
108315858208160 has 48 divisors (see below), whose sum is σ = 255909892492800. Its totient is φ = 43324027520256.
The previous prime is 108315858208157. The next prime is 108315858208189. The reversal of 108315858208160 is 61802858513801.
It is a junction number, because it is equal to n+sod(n) for n = 108315858208096 and 108315858208105.
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 7 ways as a sum of consecutive naturals, for example, 15087500 + ... + 21077579.
It is an arithmetic number, because the mean of its divisors is an integer number (5331456093600).
Almost surely, 2108315858208160 is an apocalyptic number.
108315858208160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
108315858208160 is an abundant number, since it is smaller than the sum of its proper divisors (147594034284640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108315858208160 is a wasteful number, since it uses less digits than its factorization.
108315858208160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36183813 (or 36183805 counting only the distinct ones).
The product of its (nonzero) digits is 3686400, while the sum is 56.
The spelling of 108315858208160 in words is "one hundred eight trillion, three hundred fifteen billion, eight hundred fifty-eight million, two hundred eight thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •