Base | Representation |
---|---|
bin | 110010100011000010… |
… | …1101000011011101010 |
3 | 101101012001002120220012 |
4 | 1211012011220123222 |
5 | 3234302304020400 |
6 | 121511152331522 |
7 | 10561654214234 |
oct | 1450605503352 |
9 | 341161076805 |
10 | 108550063850 |
11 | 42043754678 |
12 | 19055243ba2 |
13 | a30bcb6117 |
14 | 537a7d3254 |
15 | 2c54b8bd35 |
hex | 19461686ea |
108550063850 has 48 divisors (see below), whose sum is σ = 208917711000. Its totient is φ = 41912263680.
The previous prime is 108550063849. The next prime is 108550063859. The reversal of 108550063850 is 58360055801.
It can be written as a sum of positive squares in 12 ways, for example, as 250493929 + 108299569921 = 15827^2 + 329089^2 .
It is a junction number, because it is equal to n+sod(n) for n = 108550063798 and 108550063807.
It is not an unprimeable number, because it can be changed into a prime (108550063859) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8312126 + ... + 8325174.
Almost surely, 2108550063850 is an apocalyptic number.
108550063850 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
108550063850 is a deficient number, since it is larger than the sum of its proper divisors (100367647150).
108550063850 is a wasteful number, since it uses less digits than its factorization.
108550063850 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18827 (or 18822 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 41.
The spelling of 108550063850 in words is "one hundred eight billion, five hundred fifty million, sixty-three thousand, eight hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •