Search a number
-
+
41485157369 is a prime number
BaseRepresentation
bin100110101000101101…
…010100001111111001
310222002011122100101222
4212220231110033321
51134430200013434
631020310521425
72666020006445
oct465055241771
9128064570358
1041485157369
1116659320827
128059366275
133bb19789c6
142017929825
15112c09d72e
hex9a8b543f9

41485157369 has 2 divisors, whose sum is σ = 41485157370. Its totient is φ = 41485157368.

The previous prime is 41485157317. The next prime is 41485157423. The reversal of 41485157369 is 96375158414.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 31805155600 + 9680001769 = 178340^2 + 98387^2 .

It is a cyclic number.

It is not a de Polignac number, because 41485157369 - 28 = 41485157113 is a prime.

It is a super-2 number, since 2×414851573692 (a number of 22 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 41485157369.

It is not a weakly prime, because it can be changed into another prime (41485117369) 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, 20742578684 + 20742578685.

It is an arithmetic number, because the mean of its divisors is an integer number (20742578685).

Almost surely, 241485157369 is an apocalyptic number.

It is an amenable number.

41485157369 is a deficient number, since it is larger than the sum of its proper divisors (1).

41485157369 is an equidigital number, since it uses as much as digits as its factorization.

41485157369 is an odious number, because the sum of its binary digits is odd.

The product of its digits is 3628800, while the sum is 53.

The spelling of 41485157369 in words is "forty-one billion, four hundred eighty-five million, one hundred fifty-seven thousand, three hundred sixty-nine".