Search a number
-
+
1404897995531 is a prime number
BaseRepresentation
bin10100011100011010011…
…100100010101100001011
311222022021202102202012202
4110130122130202230023
5141004212341324111
62553222355430415
7203333452633262
oct24343234425413
94868252382182
101404897995531
114a18a5324888
121a83415b540b
13a263459c794
144bdd6d175d9
1526828167b3b
hex1471a722b0b

1404897995531 has 2 divisors, whose sum is σ = 1404897995532. Its totient is φ = 1404897995530.

The previous prime is 1404897995513. The next prime is 1404897995539. The reversal of 1404897995531 is 1355997984041.

Together with previous prime (1404897995513) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

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

It is a cyclic number.

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

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

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

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

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

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

Almost surely, 21404897995531 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 48988800, while the sum is 65.

The spelling of 1404897995531 in words is "one trillion, four hundred four billion, eight hundred ninety-seven million, nine hundred ninety-five thousand, five hundred thirty-one".