Base | Representation |
---|---|
bin | 10010110101100001000001… |
… | …00101101001101000101001 |
3 | 12102122211101102210200210111 |
4 | 21122300200211221220221 |
5 | 20412121120100442101 |
6 | 224032350343414321 |
7 | 11503404142122061 |
oct | 1132604045515051 |
9 | 172584342720714 |
10 | 41421211343401 |
11 | 1221a700a5562a |
12 | 478b85ba543a1 |
13 | 1a160078128b6 |
14 | a32b23c103a1 |
15 | 4bc6da124251 |
hex | 25ac20969a29 |
41421211343401 has 2 divisors, whose sum is σ = 41421211343402. Its totient is φ = 41421211343400.
The previous prime is 41421211343377. The next prime is 41421211343437. The reversal of 41421211343401 is 10434311212414.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23678919477801 + 17742291865600 = 4866099^2 + 4212160^2 .
It is a cyclic number.
It is not a de Polignac number, because 41421211343401 - 231 = 41419063859753 is a prime.
It is not a weakly prime, because it can be changed into another prime (41421211346401) 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 as a sum of consecutive naturals, namely, 20710605671700 + 20710605671701.
It is an arithmetic number, because the mean of its divisors is an integer number (20710605671701).
Almost surely, 241421211343401 is an apocalyptic number.
It is an amenable number.
41421211343401 is a deficient number, since it is larger than the sum of its proper divisors (1).
41421211343401 is an equidigital number, since it uses as much as digits as its factorization.
41421211343401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 31.
Adding to 41421211343401 its reverse (10434311212414), we get a palindrome (51855522555815).
The spelling of 41421211343401 in words is "forty-one trillion, four hundred twenty-one billion, two hundred eleven million, three hundred forty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •