Base | Representation |
---|---|
bin | 110010100001111000… |
… | …0111100010100100101 |
3 | 101101002022202022010222 |
4 | 1211003300330110211 |
5 | 3234212314221421 |
6 | 121503241054125 |
7 | 10561002003623 |
oct | 1450360742445 |
9 | 341068668128 |
10 | 108511085861 |
11 | 42023751962 |
12 | 19044187345 |
13 | a303bb9819 |
14 | 5375568513 |
15 | 2c5153ccab |
hex | 1943c3c525 |
108511085861 has 4 divisors (see below), whose sum is σ = 108823798272. Its totient is φ = 108198373452.
The previous prime is 108511085819. The next prime is 108511085897. The reversal of 108511085861 is 168580115801.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 108511085861 - 210 = 108511084837 is a prime.
It is a super-2 number, since 2×1085110858612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (108511085261) 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 3 ways as a sum of consecutive naturals, for example, 156355685 + ... + 156356378.
It is an arithmetic number, because the mean of its divisors is an integer number (27205949568).
Almost surely, 2108511085861 is an apocalyptic number.
It is an amenable number.
108511085861 is a deficient number, since it is larger than the sum of its proper divisors (312712411).
108511085861 is an equidigital number, since it uses as much as digits as its factorization.
108511085861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312712410.
The product of its (nonzero) digits is 76800, while the sum is 44.
The spelling of 108511085861 in words is "one hundred eight billion, five hundred eleven million, eighty-five thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •