Search a number
-
+
1001120261437 is a prime number
BaseRepresentation
bin11101001000101110110…
…10101110010100111101
310112201001210101121021101
432210113122232110331
5112400243241331222
62043524105333101
7132220456550242
oct16442732562475
93481053347241
101001120261437
1135663331999a
12142035197191
13735363c192a
143665113b5c9
151b094ca0927
hexe9176ae53d

1001120261437 has 2 divisors, whose sum is σ = 1001120261438. Its totient is φ = 1001120261436.

The previous prime is 1001120261417. The next prime is 1001120261443. The reversal of 1001120261437 is 7341620211001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 992292907321 + 8827354116 = 996139^2 + 93954^2 .

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

It is a cyclic number.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 21001120261437 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2016, while the sum is 28.

Adding to 1001120261437 its reverse (7341620211001), we get a palindrome (8342740472438).

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