Search a number
-
+
1406163515069 is a prime number
BaseRepresentation
bin10100011101100101111…
…000000111011010111101
311222102112221201210122202
4110131211320013122331
5141014310324440234
62553552124121245
7203410020444515
oct24354570073275
94872487653582
101406163515069
114a23947113a5
121a8635396225
13a27a6824301
144c0b7020845
152689e2e677e
hex14765e076bd

1406163515069 has 2 divisors, whose sum is σ = 1406163515070. Its totient is φ = 1406163515068.

The previous prime is 1406163515039. The next prime is 1406163515143. The reversal of 1406163515069 is 9605153616041.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1341323004025 + 64840511044 = 1158155^2 + 254638^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×14061635150692 (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 (1406163515039) 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, 703081757534 + 703081757535.

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

Almost surely, 21406163515069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 583200, while the sum is 47.

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