Search a number
-
+
1301100101069 is a prime number
BaseRepresentation
bin10010111011101111100…
…110111111110111001101
311121101100220101101012012
4102323233212333313031
5132304123111213234
62433414522351005
7163000321245206
oct22735746776715
94541326341165
101301100101069
114618800a642a
121901b395b465
1395901cb2112
1446d8b7125ad
1523ca07cb0ce
hex12eef9bfdcd

1301100101069 has 2 divisors, whose sum is σ = 1301100101070. Its totient is φ = 1301100101068.

The previous prime is 1301100101047. The next prime is 1301100101113. The reversal of 1301100101069 is 9601010011031.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 758881415044 + 542218686025 = 871138^2 + 736355^2 .

It is a cyclic number.

It is not a de Polignac number, because 1301100101069 - 216 = 1301100035533 is a prime.

It is a super-2 number, since 2×13011001010692 (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 (1301100101029) by changing a digit.

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

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

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

Almost surely, 21301100101069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 162, while the sum is 23.

The spelling of 1301100101069 in words is "one trillion, three hundred one billion, one hundred million, one hundred one thousand, sixty-nine".