Search a number
-
+
30656615669 is a prime number
BaseRepresentation
bin11100100011010001…
…101101010011110101
32221010111211102201222
4130203101231103311
51000241043200134
622030005400125
72133461635151
oct344321552365
987114742658
1030656615669
1112001951109
125b36a09045
132b77424394
1416ab72c061
15be65cba2e
hex72346d4f5

30656615669 has 2 divisors, whose sum is σ = 30656615670. Its totient is φ = 30656615668.

The previous prime is 30656615657. The next prime is 30656615701. The reversal of 30656615669 is 96651665603.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 30358880644 + 297735025 = 174238^2 + 17255^2 .

It is a cyclic number.

It is not a de Polignac number, because 30656615669 - 28 = 30656615413 is a prime.

It is a super-2 number, since 2×306566156692 (a number of 22 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 30656615669.

It is a congruent number.

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

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

Almost surely, 230656615669 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5248800, while the sum is 53.

The spelling of 30656615669 in words is "thirty billion, six hundred fifty-six million, six hundred fifteen thousand, six hundred sixty-nine".