Base | Representation |
---|---|
bin | 110001110110101100… |
… | …0100101001101000101 |
3 | 101020100022202221211021 |
4 | 1203231120211031011 |
5 | 3223230313443031 |
6 | 121103351111141 |
7 | 10510043534056 |
oct | 1435530451505 |
9 | 336308687737 |
10 | 107061859141 |
11 | 4144a6a0426 |
12 | 188ba9724b1 |
13 | a132893913 |
14 | 5278cc072d |
15 | 2bb91c2511 |
hex | 18ed625345 |
107061859141 has 2 divisors, whose sum is σ = 107061859142. Its totient is φ = 107061859140.
The previous prime is 107061859133. The next prime is 107061859147. The reversal of 107061859141 is 141958160701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105838958241 + 1222900900 = 325329^2 + 34970^2 .
It is a cyclic number.
It is not a de Polignac number, because 107061859141 - 23 = 107061859133 is a prime.
It is a super-2 number, since 2×1070618591412 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107061859147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53530929570 + 53530929571.
It is an arithmetic number, because the mean of its divisors is an integer number (53530929571).
Almost surely, 2107061859141 is an apocalyptic number.
It is an amenable number.
107061859141 is a deficient number, since it is larger than the sum of its proper divisors (1).
107061859141 is an equidigital number, since it uses as much as digits as its factorization.
107061859141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 60480, while the sum is 43.
The spelling of 107061859141 in words is "one hundred seven billion, sixty-one million, eight hundred fifty-nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •