Search a number
-
+
1053677046677 is a prime number
BaseRepresentation
bin11110101010101000000…
…10111100101110010101
310201201201120020220212212
433111110002330232111
5114230412310443202
62124015203523205
7136061046056333
oct17252402745625
93651646226785
101053677046677
113769532505a2
12150262389505
1378490a83718
1438dd9260b53
151c61dd3b652
hexf5540bcb95

1053677046677 has 2 divisors, whose sum is σ = 1053677046678. Its totient is φ = 1053677046676.

The previous prime is 1053677046647. The next prime is 1053677046713. The reversal of 1053677046677 is 7766407763501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 929631502276 + 124045544401 = 964174^2 + 352201^2 .

It is an emirp because it is prime and its reverse (7766407763501) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1053677046677 - 212 = 1053677042581 is a prime.

It is a super-2 number, since 2×10536770466772 (a number of 25 digits) contains 22 as substring.

It is a congruent number.

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

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

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

Almost surely, 21053677046677 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 31116960, while the sum is 59.

The spelling of 1053677046677 in words is "one trillion, fifty-three billion, six hundred seventy-seven million, forty-six thousand, six hundred seventy-seven".