Search a number
-
+
5321515110133 is a prime number
BaseRepresentation
bin100110101110000001100…
…0001001000111011110101
3200211201202112111222210011
41031130003001020323311
51144141430332011013
615152400441100221
71056316051051225
oct115340301107365
920751675458704
105321515110133
111771929603512
1271b418787671
132c7a80450571
141457c40c8085
1593658b7cc3d
hex4d703048ef5

5321515110133 has 2 divisors, whose sum is σ = 5321515110134. Its totient is φ = 5321515110132.

The previous prime is 5321515110089. The next prime is 5321515110173. The reversal of 5321515110133 is 3310115151235.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5110597199569 + 210917910564 = 2260663^2 + 459258^2 .

It is a cyclic number.

It is not a de Polignac number, because 5321515110133 - 29 = 5321515109621 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 25321515110133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6750, while the sum is 31.

The spelling of 5321515110133 in words is "five trillion, three hundred twenty-one billion, five hundred fifteen million, one hundred ten thousand, one hundred thirty-three".