Search a number
-
+
105732500282113 is a prime number
BaseRepresentation
bin11000000010100111000100…
…000111101101101100000001
3111212100221001201221110002011
4120002213010013231230001
5102324310130033011423
61012512501242252521
731161630631442125
oct3002470407555401
9455327051843064
10105732500282113
11307649a0a72311
12ba378004b7141
1346cc6bba39bb3
141c176a1dcd585
15c35529456b0d
hex6029c41edb01

105732500282113 has 2 divisors, whose sum is σ = 105732500282114. Its totient is φ = 105732500282112.

The previous prime is 105732500282107. The next prime is 105732500282183. The reversal of 105732500282113 is 311282005237501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 86161148983809 + 19571351298304 = 9282303^2 + 4423952^2 .

It is a cyclic number.

It is not a de Polignac number, because 105732500282113 - 29 = 105732500281601 is a prime.

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

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

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

Almost surely, 2105732500282113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 100800, while the sum is 40.

The spelling of 105732500282113 in words is "one hundred five trillion, seven hundred thirty-two billion, five hundred million, two hundred eighty-two thousand, one hundred thirteen".