Search a number
-
+
105535041529 is a prime number
BaseRepresentation
bin110001001001001100…
…0001110111111111001
3101002101220210120210211
41202102120032333321
53212113432312104
6120252050111121
710424154023551
oct1422230167771
9332356716724
10105535041529
1140836863795
121855357b4a1
139c4b472048
1451721da161
152b2a12be04
hex189260eff9

105535041529 has 2 divisors, whose sum is σ = 105535041530. Its totient is φ = 105535041528.

The previous prime is 105535041497. The next prime is 105535041539. The reversal of 105535041529 is 925140535501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 61821849600 + 43713191929 = 248640^2 + 209077^2 .

It is a cyclic number.

It is not a de Polignac number, because 105535041529 - 25 = 105535041497 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 105535041491 and 105535041500.

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

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

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

Almost surely, 2105535041529 is an apocalyptic number.

It is an amenable number.

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

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

105535041529 is an evil number, because the sum of its binary digits is even.

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

The spelling of 105535041529 in words is "one hundred five billion, five hundred thirty-five million, forty-one thousand, five hundred twenty-nine".