Base | Representation |
---|---|
bin | 110001011011111101… |
… | …1111100111001000101 |
3 | 101011000211110222222001 |
4 | 1202313323330321011 |
5 | 3214411240132131 |
6 | 120434355505301 |
7 | 10445604661255 |
oct | 1426773747105 |
9 | 334024428861 |
10 | 106165161541 |
11 | 4102a51422a |
12 | 186aa5b8231 |
13 | a01bb8541a |
14 | 51d1b83965 |
15 | 2b655e9261 |
hex | 18b7efce45 |
106165161541 has 2 divisors, whose sum is σ = 106165161542. Its totient is φ = 106165161540.
The previous prime is 106165161527. The next prime is 106165161563. The reversal of 106165161541 is 145161561601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 71660613025 + 34504548516 = 267695^2 + 185754^2 .
It is a cyclic number.
It is not a de Polignac number, because 106165161541 - 27 = 106165161413 is a prime.
It is a super-2 number, since 2×1061651615412 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106165161541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106165161841) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53082580770 + 53082580771.
It is an arithmetic number, because the mean of its divisors is an integer number (53082580771).
Almost surely, 2106165161541 is an apocalyptic number.
It is an amenable number.
106165161541 is a deficient number, since it is larger than the sum of its proper divisors (1).
106165161541 is an equidigital number, since it uses as much as digits as its factorization.
106165161541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 37.
The spelling of 106165161541 in words is "one hundred six billion, one hundred sixty-five million, one hundred sixty-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.059 sec. • engine limits •