Base | Representation |
---|---|
bin | 100110011000000001… |
… | …000100101110110101 |
3 | 10221100122201011212111 |
4 | 212120001010232311 |
5 | 1133342002432041 |
6 | 30532424451021 |
7 | 2656046526625 |
oct | 463001045665 |
9 | 127318634774 |
10 | 41205124021 |
11 | 16525244606 |
12 | 7b9b619a71 |
13 | 3b6894c0b9 |
14 | 1dcc672885 |
15 | 11126d5981 |
hex | 998044bb5 |
41205124021 has 4 divisors (see below), whose sum is σ = 41629919212. Its totient is φ = 40780328832.
The previous prime is 41205124001. The next prime is 41205124027. The reversal of 41205124021 is 12042150214.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8324555121 + 32880568900 = 91239^2 + 181330^2 .
It is a cyclic number.
It is not a de Polignac number, because 41205124021 - 27 = 41205123893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41205123983 and 41205124001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41205124027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 212397450 + ... + 212397643.
It is an arithmetic number, because the mean of its divisors is an integer number (10407479803).
Almost surely, 241205124021 is an apocalyptic number.
It is an amenable number.
41205124021 is a deficient number, since it is larger than the sum of its proper divisors (424795191).
41205124021 is an equidigital number, since it uses as much as digits as its factorization.
41205124021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424795190.
The product of its (nonzero) digits is 640, while the sum is 22.
Adding to 41205124021 its reverse (12042150214), we get a palindrome (53247274235).
The spelling of 41205124021 in words is "forty-one billion, two hundred five million, one hundred twenty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •