Search a number
-
+
1404906961553 is a prime number
BaseRepresentation
bin10100011100011010111…
…110101111101010010001
311222022022101022021021122
4110130122332233222101
5141004222140232203
62553223315532025
7203333622065264
oct24343276575221
94868271267248
101404906961553
114a18aa399117
121a83445ba015
13a26363bb814
144bdd81accdb
1526828d39538
hex1471afafa91

1404906961553 has 2 divisors, whose sum is σ = 1404906961554. Its totient is φ = 1404906961552.

The previous prime is 1404906961511. The next prime is 1404906961567. The reversal of 1404906961553 is 3551696094041.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1009357790224 + 395549171329 = 1004668^2 + 628927^2 .

It is a cyclic number.

It is not a de Polignac number, because 1404906961553 - 26 = 1404906961489 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (1404906961583) 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, 702453480776 + 702453480777.

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

Almost surely, 21404906961553 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1404906961553 in words is "one trillion, four hundred four billion, nine hundred six million, nine hundred sixty-one thousand, five hundred fifty-three".