Base | Representation |
---|---|
bin | 110010001111010001… |
… | …0110100011101111001 |
3 | 101022110210201111012012 |
4 | 1210132202310131321 |
5 | 3231422434023211 |
6 | 121321252455305 |
7 | 10536350124131 |
oct | 1443642643571 |
9 | 338423644165 |
10 | 107886626681 |
11 | 41833208499 |
12 | 18aab01a535 |
13 | a234708c52 |
14 | 5316655ac1 |
15 | 2c167dcd8b |
hex | 191e8b4779 |
107886626681 has 2 divisors, whose sum is σ = 107886626682. Its totient is φ = 107886626680.
The previous prime is 107886626651. The next prime is 107886626719. The reversal of 107886626681 is 186626688701.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 89227066681 + 18659560000 = 298709^2 + 136600^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-107886626681 is a prime.
It is a super-2 number, since 2×1078866266812 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 107886626681.
It is not a weakly prime, because it can be changed into another prime (107886626611) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53943313340 + 53943313341.
It is an arithmetic number, because the mean of its divisors is an integer number (53943313341).
Almost surely, 2107886626681 is an apocalyptic number.
It is an amenable number.
107886626681 is a deficient number, since it is larger than the sum of its proper divisors (1).
107886626681 is an equidigital number, since it uses as much as digits as its factorization.
107886626681 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9289728, while the sum is 59.
The spelling of 107886626681 in words is "one hundred seven billion, eight hundred eighty-six million, six hundred twenty-six thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •