Base | Representation |
---|---|
bin | 100110101011111111… |
… | …001001011010000001 |
3 | 10222020000010221020000 |
4 | 212223333021122001 |
5 | 1140033240210301 |
6 | 31025553510213 |
7 | 3000255363345 |
oct | 465377113201 |
9 | 128200127200 |
10 | 41540163201 |
11 | 16687380499 |
12 | 8073872369 |
13 | 3bc0197734 |
14 | 2020d67625 |
15 | 1131d16786 |
hex | 9abfc9681 |
41540163201 has 80 divisors (see below), whose sum is σ = 67266397440. Its totient is φ = 25461928800.
The previous prime is 41540163167. The next prime is 41540163227. The reversal of 41540163201 is 10236104514.
It is a happy number.
41540163201 is a `hidden beast` number, since 41 + 540 + 1 + 63 + 20 + 1 = 666.
It is not a de Polignac number, because 41540163201 - 211 = 41540161153 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (41540163271) 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 in 79 ways as a sum of consecutive naturals, for example, 10784926 + ... + 10788776.
It is an arithmetic number, because the mean of its divisors is an integer number (840829968).
Almost surely, 241540163201 is an apocalyptic number.
It is an amenable number.
41540163201 is a deficient number, since it is larger than the sum of its proper divisors (25726234239).
41540163201 is a wasteful number, since it uses less digits than its factorization.
41540163201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4088 (or 4079 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 41540163201 its reverse (10236104514), we get a palindrome (51776267715).
The spelling of 41540163201 in words is "forty-one billion, five hundred forty million, one hundred sixty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •