Search a number
-
+
1306055615629 is a prime number
BaseRepresentation
bin10011000000010110111…
…110110010010010001101
311121212011021001121012111
4103000112332302102031
5132344300214200004
62435554344304021
7163234163363422
oct23002676622215
94555137047174
101306055615629
11463993389906
12191157472011
139621186665b
14472db913d49
1523e90896a04
hex13016fb248d

1306055615629 has 2 divisors, whose sum is σ = 1306055615630. Its totient is φ = 1306055615628.

The previous prime is 1306055615611. The next prime is 1306055615639. The reversal of 1306055615629 is 9265165506031.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1204501860004 + 101553755625 = 1097498^2 + 318675^2 .

It is a cyclic number.

It is not a de Polignac number, because 1306055615629 - 227 = 1305921397901 is a prime.

It is a super-2 number, since 2×13060556156292 (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 (1306055615609) 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, 653027807814 + 653027807815.

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

Almost surely, 21306055615629 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1458000, while the sum is 49.

The spelling of 1306055615629 in words is "one trillion, three hundred six billion, fifty-five million, six hundred fifteen thousand, six hundred twenty-nine".