Search a number
-
+
1053613535489 is a prime number
BaseRepresentation
bin11110101010100000100…
…00101011000100000001
310201201120010202012220122
433111100100223010001
5114230300031113424
62124005014350025
7136056345166454
oct17252020530401
93651503665818
101053613535489
11376920411709
1215024505b315
1378480877538
1438dd0a4b49b
151c61849345e
hexf55042b101

1053613535489 has 2 divisors, whose sum is σ = 1053613535490. Its totient is φ = 1053613535488.

The previous prime is 1053613535479. The next prime is 1053613535573. The reversal of 1053613535489 is 9845353163501.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 736850560000 + 316762975489 = 858400^2 + 562817^2 .

It is a cyclic number.

It is not a de Polignac number, because 1053613535489 - 228 = 1053345100033 is a prime.

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

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

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

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

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

Almost surely, 21053613535489 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5832000, while the sum is 53.

The spelling of 1053613535489 in words is "one trillion, fifty-three billion, six hundred thirteen million, five hundred thirty-five thousand, four hundred eighty-nine".