Search a number
-
+
1042146150641 is a prime number
BaseRepresentation
bin11110010101001001100…
…00000100100011110001
310200121221221211201012022
433022210300010203301
5114033303403310031
62114431052441225
7135202232056541
oct17124460044361
93617857751168
101042146150641
11371a76373752
12149b84779215
1377373b7720b
1438623a75321
151c19687e97b
hexf2a4c048f1

1042146150641 has 2 divisors, whose sum is σ = 1042146150642. Its totient is φ = 1042146150640.

The previous prime is 1042146150629. The next prime is 1042146150659. The reversal of 1042146150641 is 1460516412401.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 773879127616 + 268267023025 = 879704^2 + 517945^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1042146150641 - 234 = 1024966281457 is a prime.

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

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

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

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

Almost surely, 21042146150641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 23040, while the sum is 35.

The spelling of 1042146150641 in words is "one trillion, forty-two billion, one hundred forty-six million, one hundred fifty thousand, six hundred forty-one".