Search a number
-
+
5033313100433 is a prime number
BaseRepresentation
bin100100100111110100011…
…0101101110001010010001
3122211011212020120222011202
41021033220311232022101
51124431211123203213
614412134435520545
71026434122305002
oct111175065561221
918734766528152
105033313100433
111670686032a22
126935a6459155
132a6840977507
14135883c1b1a9
158addc139b58
hex493e8d6e291

5033313100433 has 2 divisors, whose sum is σ = 5033313100434. Its totient is φ = 5033313100432.

The previous prime is 5033313100421. The next prime is 5033313100441. The reversal of 5033313100433 is 3340013133305.

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., 4035406004224 + 997907096209 = 2008832^2 + 998953^2 .

It is a cyclic number.

It is not a de Polignac number, because 5033313100433 - 224 = 5033296323217 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

Almost surely, 25033313100433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 14580, while the sum is 29.

Adding to 5033313100433 its reverse (3340013133305), we get a palindrome (8373326233738).

The spelling of 5033313100433 in words is "five trillion, thirty-three billion, three hundred thirteen million, one hundred thousand, four hundred thirty-three".