Search a number
-
+
104133000533 is a prime number
BaseRepresentation
bin110000011111011001…
…1110111110101010101
3100221210012121112010112
41200332303313311111
53201231022004113
6115501003332405
710344340620512
oct1407663676525
9327705545115
10104133000533
1140187400621
1218221b21105
139a86b5a5a3
14507bd16309
152a96ed25a8
hex183ecf7d55

104133000533 has 2 divisors, whose sum is σ = 104133000534. Its totient is φ = 104133000532.

The previous prime is 104133000487. The next prime is 104133000551. The reversal of 104133000533 is 335000331401.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 62559013924 + 41573986609 = 250118^2 + 203897^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-104133000533 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2104133000533 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1620, while the sum is 23.

Adding to 104133000533 its reverse (335000331401), we get a palindrome (439133331934).

The spelling of 104133000533 in words is "one hundred four billion, one hundred thirty-three million, five hundred thirty-three", and thus it is an aban number.