Base | Representation |
---|---|
bin | 110010001001000000… |
… | …0100110100001001101 |
3 | 101021221011000022110111 |
4 | 1210102000212201031 |
5 | 3231010120030221 |
6 | 121244341240021 |
7 | 10531214463346 |
oct | 1442200464115 |
9 | 337834008414 |
10 | 107676330061 |
11 | 41735532533 |
12 | 18a50703011 |
13 | a1ccc88091 |
14 | 52d67530cd |
15 | 2c030ecbe1 |
hex | 191202684d |
107676330061 has 2 divisors, whose sum is σ = 107676330062. Its totient is φ = 107676330060.
The previous prime is 107676330011. The next prime is 107676330103. The reversal of 107676330061 is 160033676701.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 74599996900 + 33076333161 = 273130^2 + 181869^2 .
It is an emirp because it is prime and its reverse (160033676701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 107676330061 - 27 = 107676329933 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 107676329996 and 107676330023.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107676330011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53838165030 + 53838165031.
It is an arithmetic number, because the mean of its divisors is an integer number (53838165031).
Almost surely, 2107676330061 is an apocalyptic number.
It is an amenable number.
107676330061 is a deficient number, since it is larger than the sum of its proper divisors (1).
107676330061 is an equidigital number, since it uses as much as digits as its factorization.
107676330061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 95256, while the sum is 40.
The spelling of 107676330061 in words is "one hundred seven billion, six hundred seventy-six million, three hundred thirty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •