Base | Representation |
---|---|
bin | 110010001110110010… |
… | …1111001100111000001 |
3 | 101022102200200010212002 |
4 | 1210131211321213001 |
5 | 3231404342010321 |
6 | 121315522313345 |
7 | 10536064312154 |
oct | 1443545714701 |
9 | 338380603762 |
10 | 107870656961 |
11 | 418251a0181 |
12 | 18aa57b8855 |
13 | a231307102 |
14 | 5314499c9b |
15 | 2c151d620b |
hex | 191d9799c1 |
107870656961 has 2 divisors, whose sum is σ = 107870656962. Its totient is φ = 107870656960.
The previous prime is 107870656931. The next prime is 107870656963. The reversal of 107870656961 is 169656078701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98746777600 + 9123879361 = 314240^2 + 95519^2 .
It is a cyclic number.
It is not a de Polignac number, because 107870656961 - 222 = 107866462657 is a prime.
Together with 107870656963, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 107870656897 and 107870656906.
It is not a weakly prime, because it can be changed into another prime (107870656963) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53935328480 + 53935328481.
It is an arithmetic number, because the mean of its divisors is an integer number (53935328481).
Almost surely, 2107870656961 is an apocalyptic number.
It is an amenable number.
107870656961 is a deficient number, since it is larger than the sum of its proper divisors (1).
107870656961 is an equidigital number, since it uses as much as digits as its factorization.
107870656961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3810240, while the sum is 56.
The spelling of 107870656961 in words is "one hundred seven billion, eight hundred seventy million, six hundred fifty-six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •