Base | Representation |
---|---|
bin | 110010101100110010… |
… | …0010001000111011001 |
3 | 101102000211000122120011 |
4 | 1211121210101013121 |
5 | 3240434434040123 |
6 | 122003425001521 |
7 | 10603033025251 |
oct | 1453144210731 |
9 | 342024018504 |
10 | 108876861913 |
11 | 421a1171916 |
12 | 191267832a1 |
13 | a361907661 |
14 | 53abd80961 |
15 | 2c736e0e0d |
hex | 19599111d9 |
108876861913 has 8 divisors (see below), whose sum is σ = 115299920232. Its totient is φ = 102455863296.
The previous prime is 108876861911. The next prime is 108876861941. The reversal of 108876861913 is 319168678801.
It can be written as a sum of positive squares in 4 ways, for example, as 63934133904 + 44942728009 = 252852^2 + 211997^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 108876861913 - 21 = 108876861911 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (108876861911) 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 7 ways as a sum of consecutive naturals, for example, 405420 + ... + 618157.
It is an arithmetic number, because the mean of its divisors is an integer number (14412490029).
Almost surely, 2108876861913 is an apocalyptic number.
It is an amenable number.
108876861913 is a deficient number, since it is larger than the sum of its proper divisors (6423058319).
108876861913 is a wasteful number, since it uses less digits than its factorization.
108876861913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1029851.
The product of its (nonzero) digits is 3483648, while the sum is 58.
The spelling of 108876861913 in words is "one hundred eight billion, eight hundred seventy-six million, eight hundred sixty-one thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •