Base | Representation |
---|---|
bin | 10010101100110010000011… |
… | …10100110000001111001101 |
3 | 12101121010210122022221102212 |
4 | 21112121001310300033031 |
5 | 20342212024014140023 |
6 | 223242440551200205 |
7 | 11442621501253343 |
oct | 1126310164601715 |
9 | 171533718287385 |
10 | 41121121240013 |
11 | 12114407a07321 |
12 | 4741670376065 |
13 | 19c3922126c99 |
14 | a223b6b35993 |
15 | 4b49c4ab7e78 |
hex | 256641d303cd |
41121121240013 has 2 divisors, whose sum is σ = 41121121240014. Its totient is φ = 41121121240012.
The previous prime is 41121121239959. The next prime is 41121121240051. The reversal of 41121121240013 is 31004212112114.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 39854499293764 + 1266621946249 = 6313042^2 + 1125443^2 .
It is a cyclic number.
It is not a de Polignac number, because 41121121240013 - 214 = 41121121223629 is a prime.
It is a super-2 number, since 2×411211212400132 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41121121240063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20560560620006 + 20560560620007.
It is an arithmetic number, because the mean of its divisors is an integer number (20560560620007).
Almost surely, 241121121240013 is an apocalyptic number.
It is an amenable number.
41121121240013 is a deficient number, since it is larger than the sum of its proper divisors (1).
41121121240013 is an equidigital number, since it uses as much as digits as its factorization.
41121121240013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 41121121240013 its reverse (31004212112114), we get a palindrome (72125333352127).
The spelling of 41121121240013 in words is "forty-one trillion, one hundred twenty-one billion, one hundred twenty-one million, two hundred forty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •