Search a number
-
+
1267040400469 is a prime number
BaseRepresentation
bin10010011100000001011…
…111100011010001010101
311111010110020001022112121
4102130001133203101111
5131224344320303334
62410023105015541
7160353304463434
oct22340137432125
94433406038477
101267040400469
11449392302238
121856893245b1
1392634824a1c
144547a05311b
1522e5a587db4
hex127017e3455

1267040400469 has 2 divisors, whose sum is σ = 1267040400470. Its totient is φ = 1267040400468.

The previous prime is 1267040400407. The next prime is 1267040400481. The reversal of 1267040400469 is 9640040407621.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 860840674225 + 406199726244 = 927815^2 + 637338^2 .

It is a cyclic number.

It is not a de Polignac number, because 1267040400469 - 29 = 1267040399957 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21267040400469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 290304, while the sum is 43.

The spelling of 1267040400469 in words is "one trillion, two hundred sixty-seven billion, forty million, four hundred thousand, four hundred sixty-nine".