Search a number
-
+
5335271073061 is a prime number
BaseRepresentation
bin100110110100011011011…
…1011111110010100100101
3200220001021012210022102121
41031220312323332110211
51144403113343314221
615202553435105541
71060313663601346
oct115506673762445
920801235708377
105335271073061
111777748481016
127220175a22b1
132c9163326bb7
1414632add80cd
1593bb1658a41
hex4da36efe525

5335271073061 has 2 divisors, whose sum is σ = 5335271073062. Its totient is φ = 5335271073060.

The previous prime is 5335271072987. The next prime is 5335271073127. The reversal of 5335271073061 is 1603701725335.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3841972409025 + 1493298664036 = 1960095^2 + 1222006^2 .

It is a cyclic number.

It is not a de Polignac number, because 5335271073061 - 27 = 5335271072933 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 25335271073061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 396900, while the sum is 43.

Adding to 5335271073061 its reverse (1603701725335), we get a palindrome (6938972798396).

The spelling of 5335271073061 in words is "five trillion, three hundred thirty-five billion, two hundred seventy-one million, seventy-three thousand, sixty-one".