Base | Representation |
---|---|
bin | 110001110010111100… |
… | …1001101010001110001 |
3 | 101020000120022111212202 |
4 | 1203211321031101301 |
5 | 3223001131203121 |
6 | 121043101432545 |
7 | 10503656436626 |
oct | 1434571152161 |
9 | 336016274782 |
10 | 106936194161 |
11 | 4139576a475 |
12 | 1888486b755 |
13 | a112835344 |
14 | 526632c34d |
15 | 2bad14d40b |
hex | 18e5e4d471 |
106936194161 has 2 divisors, whose sum is σ = 106936194162. Its totient is φ = 106936194160.
The previous prime is 106936194151. The next prime is 106936194187. The reversal of 106936194161 is 161491639601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 105734878561 + 1201315600 = 325169^2 + 34660^2 .
It is a cyclic number.
It is not a de Polignac number, because 106936194161 - 26 = 106936194097 is a prime.
It is a super-2 number, since 2×1069361941612 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (106936194151) 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, 53468097080 + 53468097081.
It is an arithmetic number, because the mean of its divisors is an integer number (53468097081).
Almost surely, 2106936194161 is an apocalyptic number.
It is an amenable number.
106936194161 is a deficient number, since it is larger than the sum of its proper divisors (1).
106936194161 is an equidigital number, since it uses as much as digits as its factorization.
106936194161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 209952, while the sum is 47.
The spelling of 106936194161 in words is "one hundred six billion, nine hundred thirty-six million, one hundred ninety-four thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •