Search a number
-
+
1543117013069 is a prime number
BaseRepresentation
bin10110011101001000111…
…100010000000001001101
312110112001110220100022112
4112131020330100001031
5200240300423404234
63140522000553405
7216325610123012
oct26351074200115
95415043810275
101543117013069
11545483363495
1220b096922865
13b269119c8a8
1454989bbd709
152a21783aace
hex16748f1004d

1543117013069 has 2 divisors, whose sum is σ = 1543117013070. Its totient is φ = 1543117013068.

The previous prime is 1543117013059. The next prime is 1543117013093. The reversal of 1543117013069 is 9603107113451.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 997052175625 + 546064837444 = 998525^2 + 738962^2 .

It is a cyclic number.

It is not a de Polignac number, because 1543117013069 - 220 = 1543115964493 is a prime.

It is a super-2 number, since 2×15431170130692 (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 (1543117013059) 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, 771558506534 + 771558506535.

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

Almost surely, 21543117013069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 68040, while the sum is 41.

The spelling of 1543117013069 in words is "one trillion, five hundred forty-three billion, one hundred seventeen million, thirteen thousand, sixty-nine".