Search a number
-
+
1001461201537 is a prime number
BaseRepresentation
bin11101001001010111011…
…11010011101010000001
310112201221112221011011111
432210223233103222001
5112401443031422122
62044022005043321
7132232066521556
oct16445357235201
93481845834144
101001461201537
11356798816275
1214210b3b6541
137358bc25134
143668452aa2d
151b0b4b99d77
hexe92bbd3a81

1001461201537 has 2 divisors, whose sum is σ = 1001461201538. Its totient is φ = 1001461201536.

The previous prime is 1001461201513. The next prime is 1001461201553. The reversal of 1001461201537 is 7351021641001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 664133723136 + 337327478401 = 814944^2 + 580799^2 .

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1001461201537 is a prime.

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

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

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

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

Almost surely, 21001461201537 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 1001461201537 its reverse (7351021641001), we get a palindrome (8352482842538).

The spelling of 1001461201537 in words is "one trillion, one billion, four hundred sixty-one million, two hundred one thousand, five hundred thirty-seven".