Base | Representation |
---|---|
bin | 10010101010110111100010… |
… | …00010001100101101010001 |
3 | 12101100212000022202210100002 |
4 | 21111123301002030231101 |
5 | 20340122314333104221 |
6 | 223152321410535345 |
7 | 11435102426065250 |
oct | 1125336102145521 |
9 | 171325008683302 |
10 | 41055341300561 |
11 | 120995219431a5 |
12 | 4730972897555 |
13 | 19ba66b0901a3 |
14 | a1d136798797 |
15 | 4b2e24bea80b |
hex | 2556f108cb51 |
41055341300561 has 4 divisors (see below), whose sum is σ = 46920390057792. Its totient is φ = 35190292543332.
The previous prime is 41055341300543. The next prime is 41055341300573. The reversal of 41055341300561 is 16500314355014.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 41055341300561 - 218 = 41055341038417 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41055341320561) 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, 2932524378605 + ... + 2932524378618.
It is an arithmetic number, because the mean of its divisors is an integer number (11730097514448).
Almost surely, 241055341300561 is an apocalyptic number.
It is an amenable number.
41055341300561 is a deficient number, since it is larger than the sum of its proper divisors (5865048757231).
41055341300561 is an equidigital number, since it uses as much as digits as its factorization.
41055341300561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5865048757230.
The product of its (nonzero) digits is 108000, while the sum is 38.
Adding to 41055341300561 its reverse (16500314355014), we get a palindrome (57555655655575).
The spelling of 41055341300561 in words is "forty-one trillion, fifty-five billion, three hundred forty-one million, three hundred thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •