Search a number
-
+
105345314041537 is a prime number
BaseRepresentation
bin10111111100111110011110…
…000001011010111011000001
3111210222220200001201111111201
4113330332132001122323001
5102301434200343312122
61012014545201341201
731121643041626243
oct2774763601327301
9453886601644451
10105345314041537
1130625773480039
12b994764637801
1346a203602302b
141c02a51956093
15c2a417972a27
hex5fcf9e05aec1

105345314041537 has 2 divisors, whose sum is σ = 105345314041538. Its totient is φ = 105345314041536.

The previous prime is 105345314041523. The next prime is 105345314041543. The reversal of 105345314041537 is 735140413543501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 104117452809616 + 1227861231921 = 10203796^2 + 1108089^2 .

It is a cyclic number.

It is not a de Polignac number, because 105345314041537 - 211 = 105345314039489 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (105345314041567) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52672657020768 + 52672657020769.

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

Almost surely, 2105345314041537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1512000, while the sum is 46.

The spelling of 105345314041537 in words is "one hundred five trillion, three hundred forty-five billion, three hundred fourteen million, forty-one thousand, five hundred thirty-seven".