Base | Representation |
---|---|
bin | 100110101001111101… |
… | …001111101011010001 |
3 | 10222010122001212020022 |
4 | 212221331033223101 |
5 | 1140001031011121 |
6 | 31022335553225 |
7 | 2666363054345 |
oct | 465175175321 |
9 | 128118055208 |
10 | 41506110161 |
11 | 1666a13198a |
12 | 806438b815 |
13 | 3bb61039c9 |
14 | 201a621625 |
15 | 112dd3baab |
hex | 9a9f4fad1 |
41506110161 has 2 divisors, whose sum is σ = 41506110162. Its totient is φ = 41506110160.
The previous prime is 41506110101. The next prime is 41506110167. The reversal of 41506110161 is 16101160514.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 38777092561 + 2729017600 = 196919^2 + 52240^2 .
It is a cyclic number.
It is not a de Polignac number, because 41506110161 - 210 = 41506109137 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 41506110161.
It is not a weakly prime, because it can be changed into another prime (41506110167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20753055080 + 20753055081.
It is an arithmetic number, because the mean of its divisors is an integer number (20753055081).
Almost surely, 241506110161 is an apocalyptic number.
It is an amenable number.
41506110161 is a deficient number, since it is larger than the sum of its proper divisors (1).
41506110161 is an equidigital number, since it uses as much as digits as its factorization.
41506110161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 26.
Adding to 41506110161 its reverse (16101160514), we get a palindrome (57607270675).
The spelling of 41506110161 in words is "forty-one billion, five hundred six million, one hundred ten thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •