Search a number
-
+
104521133011409 is a prime number
BaseRepresentation
bin10111110000111110111001…
…000000010011000111010001
3111201002010022110201011011122
4113300332321000103013101
5102144433240022331114
61010144202353452025
731005255053515142
oct2760767100230721
9451063273634148
10104521133011409
11303381887a7524
12b880a8bb71015
1346423ba40560a
141bb4bc7d0dac9
15c13c7b830e8e
hex5f0fb90131d1

104521133011409 has 2 divisors, whose sum is σ = 104521133011410. Its totient is φ = 104521133011408.

The previous prime is 104521133011367. The next prime is 104521133011447. The reversal of 104521133011409 is 904110331125401.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 104002773330625 + 518359680784 = 10198175^2 + 719972^2 .

It is a cyclic number.

It is not a de Polignac number, because 104521133011409 - 28 = 104521133011153 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2104521133011409 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12960, while the sum is 35.

The spelling of 104521133011409 in words is "one hundred four trillion, five hundred twenty-one billion, one hundred thirty-three million, eleven thousand, four hundred nine".