Base | Representation |
---|---|
bin | 100110101010111010… |
… | …011110111100011001 |
3 | 10222011202021110020201 |
4 | 212222322132330121 |
5 | 1140014133212411 |
6 | 31024112022201 |
7 | 2666646365131 |
oct | 465272367431 |
9 | 128152243221 |
10 | 41522163481 |
11 | 166781a6a97 |
12 | 8069831961 |
13 | 3bb9534906 |
14 | 201c7ddac1 |
15 | 113045d3c1 |
hex | 9aae9ef19 |
41522163481 has 2 divisors, whose sum is σ = 41522163482. Its totient is φ = 41522163480.
The previous prime is 41522163479. The next prime is 41522163493. The reversal of 41522163481 is 18436122514.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 24749582400 + 16772581081 = 157320^2 + 129509^2 .
It is a cyclic number.
It is not a de Polignac number, because 41522163481 - 21 = 41522163479 is a prime.
It is a super-2 number, since 2×415221634812 (a number of 22 digits) contains 22 as substring.
Together with 41522163479, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 41522163481.
It is not a weakly prime, because it can be changed into another prime (41522166481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20761081740 + 20761081741.
It is an arithmetic number, because the mean of its divisors is an integer number (20761081741).
Almost surely, 241522163481 is an apocalyptic number.
It is an amenable number.
41522163481 is a deficient number, since it is larger than the sum of its proper divisors (1).
41522163481 is an equidigital number, since it uses as much as digits as its factorization.
41522163481 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 46080, while the sum is 37.
Adding to 41522163481 its reverse (18436122514), we get a palindrome (59958285995).
The spelling of 41522163481 in words is "forty-one billion, five hundred twenty-two million, one hundred sixty-three thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •