Base | Representation |
---|---|
bin | 10010110010100100011100… |
… | …00000111000111000100101 |
3 | 12102022011001121120012201122 |
4 | 21121102032000320320211 |
5 | 20403441243301011224 |
6 | 223514044203103325 |
7 | 11463161216562365 |
oct | 1131221600707045 |
9 | 172264047505648 |
10 | 41319967985189 |
11 | 1219077779a063 |
12 | 4774105811b45 |
13 | 1a095c153a74a |
14 | a2bc7b9b49a5 |
15 | 4b9c61b8715e |
hex | 25948e038e25 |
41319967985189 has 2 divisors, whose sum is σ = 41319967985190. Its totient is φ = 41319967985188.
The previous prime is 41319967985081. The next prime is 41319967985203. The reversal of 41319967985189 is 98158976991314.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26138167502500 + 15181800482689 = 5112550^2 + 3896383^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41319967985189 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41319967985689) 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, 20659983992594 + 20659983992595.
It is an arithmetic number, because the mean of its divisors is an integer number (20659983992595).
Almost surely, 241319967985189 is an apocalyptic number.
It is an amenable number.
41319967985189 is a deficient number, since it is larger than the sum of its proper divisors (1).
41319967985189 is an equidigital number, since it uses as much as digits as its factorization.
41319967985189 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1058158080, while the sum is 80.
The spelling of 41319967985189 in words is "forty-one trillion, three hundred nineteen billion, nine hundred sixty-seven million, nine hundred eighty-five thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •