Search a number
-
+
15682166425433 is a prime number
BaseRepresentation
bin1110010000110100100111…
…1101011000011101011001
32001112012102010211022201202
43210031021331120131121
54023414034101103213
653204142055323545
73205666463141264
oct344151175303531
961465363738652
1015682166425433
114aa68511286a2
1219133859805b5
13899a8ba89421
143c3041511cdb
151c2de0c89b58
hexe4349f58759

15682166425433 has 2 divisors, whose sum is σ = 15682166425434. Its totient is φ = 15682166425432.

The previous prime is 15682166425417. The next prime is 15682166425459. The reversal of 15682166425433 is 33452466128651.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 11039059410064 + 4643107015369 = 3322508^2 + 2154787^2 .

It is a cyclic number.

It is not a de Polignac number, because 15682166425433 - 24 = 15682166425417 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is not a weakly prime, because it can be changed into another prime (15682166425403) 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, 7841083212716 + 7841083212717.

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

Almost surely, 215682166425433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 24883200, while the sum is 56.

The spelling of 15682166425433 in words is "fifteen trillion, six hundred eighty-two billion, one hundred sixty-six million, four hundred twenty-five thousand, four hundred thirty-three".