Base | Representation |
---|---|
bin | 110001110111011011… |
… | …0100111101101101101 |
3 | 101020102001011101202111 |
4 | 1203232312213231231 |
5 | 3223303121322312 |
6 | 121110031324021 |
7 | 10510463216206 |
oct | 1435666475555 |
9 | 336361141674 |
10 | 107086510957 |
11 | 414625a8728 |
12 | 18907080611 |
13 | a137a154aa |
14 | 527c29a5ad |
15 | 2bbb4418a7 |
hex | 18eeda7b6d |
107086510957 has 8 divisors (see below), whose sum is σ = 111862751040. Its totient is φ = 102320296320.
The previous prime is 107086510943. The next prime is 107086510963. The reversal of 107086510957 is 759015680701.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-107086510957 is a prime.
It is a super-2 number, since 2×1070865109572 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 107086510957.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107086510987) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2484519 + ... + 2527252.
It is an arithmetic number, because the mean of its divisors is an integer number (13982843880).
Almost surely, 2107086510957 is an apocalyptic number.
It is an amenable number.
107086510957 is a deficient number, since it is larger than the sum of its proper divisors (4776240083).
107086510957 is an equidigital number, since it uses as much as digits as its factorization.
107086510957 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5012723.
The product of its (nonzero) digits is 529200, while the sum is 49.
The spelling of 107086510957 in words is "one hundred seven billion, eighty-six million, five hundred ten thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •