Search a number
-
+
10053147405577 is a prime number
BaseRepresentation
bin1001001001001010111001…
…0001111010110100001001
31022121001221010110012020011
42102102232101322310021
52304202321213434302
633214204022231521
72055213236005513
oct222225621726411
938531833405204
1010053147405577
113226574697501
12116444a8855a1
1357c013cb07c3
1426a809876bb3
1512678ac975d7
hex924ae47ad09

10053147405577 has 2 divisors, whose sum is σ = 10053147405578. Its totient is φ = 10053147405576.

The previous prime is 10053147405571. The next prime is 10053147405641. The reversal of 10053147405577 is 77550474135001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9676647354361 + 376500051216 = 3110731^2 + 613596^2 .

It is a cyclic number.

It is not a de Polignac number, because 10053147405577 - 215 = 10053147372809 is a prime.

It is a super-3 number, since 3×100531474055773 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a self number, because there is not a number n which added to its sum of digits gives 10053147405577.

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

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

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

Almost surely, 210053147405577 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2058000, while the sum is 49.

The spelling of 10053147405577 in words is "ten trillion, fifty-three billion, one hundred forty-seven million, four hundred five thousand, five hundred seventy-seven".