Search a number
-
+
1616061150997 is a prime number
BaseRepresentation
bin10111100001000100110…
…000000011011100010101
312201111100002011111011121
4113201010300003130111
5202434143123312442
63234224103003541
7224520334064116
oct27410460033425
95644302144147
101616061150997
115734054309a7
122212537395b1
13b9517570097
145830981a20d
152c086658967
hex17844c03715

1616061150997 has 2 divisors, whose sum is σ = 1616061150998. Its totient is φ = 1616061150996.

The previous prime is 1616061150947. The next prime is 1616061151039. The reversal of 1616061150997 is 7990511606161.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1325167043281 + 290894107716 = 1151159^2 + 539346^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×16160611509972 (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 (1616061150947) 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, 808030575498 + 808030575499.

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

Almost surely, 21616061150997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 612360, while the sum is 52.

The spelling of 1616061150997 in words is "one trillion, six hundred sixteen billion, sixty-one million, one hundred fifty thousand, nine hundred ninety-seven".