Search a number
-
+
30665643604153 is a prime number
BaseRepresentation
bin1101111100011111001101…
…10010110011100010111001
311000120121101102120102012121
412332033212302303202321
513004411214230313103
6145115334023441241
76313343143564315
oct676174662634271
9130517342512177
1030665643604153
1198532543a9a78
123533259bb6221
1314159b0b0a27c
1478032183cb45
15382a3ca836bd
hex1be3e6cb38b9

30665643604153 has 2 divisors, whose sum is σ = 30665643604154. Its totient is φ = 30665643604152.

The previous prime is 30665643604147. The next prime is 30665643604217. The reversal of 30665643604153 is 35140634656603.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 21377704701609 + 9287938902544 = 4623603^2 + 3047612^2 .

It is a cyclic number.

It is not a de Polignac number, because 30665643604153 - 237 = 30528204650681 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (30665643607153) by changing a digit.

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

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

Almost surely, 230665643604153 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 30665643604153 in words is "thirty trillion, six hundred sixty-five billion, six hundred forty-three million, six hundred four thousand, one hundred fifty-three".