Base | Representation |
---|---|
bin | 100110101010010000… |
… | …000100110110001101 |
3 | 10222010222100122200012 |
4 | 212222100010312031 |
5 | 1140003311442131 |
6 | 31023033443005 |
7 | 2666453034206 |
oct | 465220046615 |
9 | 128128318605 |
10 | 41511046541 |
11 | 166719a3738 |
12 | 8065b70465 |
13 | 3bb7141843 |
14 | 201b1485ad |
15 | 112e4b452b |
hex | 9aa404d8d |
41511046541 has 2 divisors, whose sum is σ = 41511046542. Its totient is φ = 41511046540.
The previous prime is 41511046519. The next prime is 41511046559. The reversal of 41511046541 is 14564011514.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 39499972516 + 2011074025 = 198746^2 + 44845^2 .
It is a cyclic number.
It is not a de Polignac number, because 41511046541 - 26 = 41511046477 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41511046498 and 41511046507.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41511046141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20755523270 + 20755523271.
It is an arithmetic number, because the mean of its divisors is an integer number (20755523271).
Almost surely, 241511046541 is an apocalyptic number.
It is an amenable number.
41511046541 is a deficient number, since it is larger than the sum of its proper divisors (1).
41511046541 is an equidigital number, since it uses as much as digits as its factorization.
41511046541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9600, while the sum is 32.
The spelling of 41511046541 in words is "forty-one billion, five hundred eleven million, forty-six thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •