Base | Representation |
---|---|
bin | 1100110001000… |
… | …01000011110001 |
3 | 21110111202002021 |
4 | 12120201003301 |
5 | 204403341121 |
6 | 14343151441 |
7 | 2440152133 |
oct | 630410361 |
9 | 243452067 |
10 | 107090161 |
11 | 554a4472 |
12 | 2ba45581 |
13 | 19256a79 |
14 | 10319053 |
15 | 9605641 |
hex | 66210f1 |
107090161 has 2 divisors, whose sum is σ = 107090162. Its totient is φ = 107090160.
The previous prime is 107090147. The next prime is 107090183. The reversal of 107090161 is 161090701.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106481761 + 608400 = 10319^2 + 780^2 .
It is an emirp because it is prime and its reverse (161090701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 107090161 - 25 = 107090129 is a prime.
It is a super-2 number, since 2×1070901612 = 22936605166011842, which contains 22 as substring.
It is an alternating number because its digits alternate between odd and even.
It is not a weakly prime, because it can be changed into another prime (107090131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53545080 + 53545081.
It is an arithmetic number, because the mean of its divisors is an integer number (53545081).
Almost surely, 2107090161 is an apocalyptic number.
It is an amenable number.
107090161 is a deficient number, since it is larger than the sum of its proper divisors (1).
107090161 is an equidigital number, since it uses as much as digits as its factorization.
107090161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 378, while the sum is 25.
The square root of 107090161 is about 10348.4376115431. The cubic root of 107090161 is about 474.8792468674.
The spelling of 107090161 in words is "one hundred seven million, ninety thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •