Base | Representation |
---|---|
bin | 10010101010110111100010… |
… | …00101011010001010101001 |
3 | 12101100212000101100112201222 |
4 | 21111123301011122022221 |
5 | 20340122320042021441 |
6 | 223152321440551425 |
7 | 11435102436201626 |
oct | 1125336105321251 |
9 | 171325011315658 |
10 | 41055342142121 |
11 | 120995223684aa |
12 | 4730973022575 |
13 | 19ba66b2c6258 |
14 | a1d13693734d |
15 | 4b2e24d14d4b |
hex | 2556f115a2a9 |
41055342142121 has 2 divisors, whose sum is σ = 41055342142122. Its totient is φ = 41055342142120.
The previous prime is 41055342142069. The next prime is 41055342142151. The reversal of 41055342142121 is 12124124355014.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31876593316096 + 9178748826025 = 5645936^2 + 3029645^2 .
It is a cyclic number.
It is not a de Polignac number, because 41055342142121 - 210 = 41055342141097 is a prime.
It is a super-2 number, since 2×410553421421212 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (41055342142151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20527671071060 + 20527671071061.
It is an arithmetic number, because the mean of its divisors is an integer number (20527671071061).
Almost surely, 241055342142121 is an apocalyptic number.
It is an amenable number.
41055342142121 is a deficient number, since it is larger than the sum of its proper divisors (1).
41055342142121 is an equidigital number, since it uses as much as digits as its factorization.
41055342142121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 38400, while the sum is 35.
Adding to 41055342142121 its reverse (12124124355014), we get a palindrome (53179466497135).
The spelling of 41055342142121 in words is "forty-one trillion, fifty-five billion, three hundred forty-two million, one hundred forty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •