Search a number
-
+
30556421124469 is a prime number
BaseRepresentation
bin1101111001010011110001…
…01000000111000101110101
311000012011110112012120012021
412330221320220013011311
513001114022301440334
6144553232010553141
76302425413043042
oct674517050070565
9130164415176167
1030556421124469
1198109a6136439
1235160577387b1
1314085c5722276
14778d1da121c9
1537ec98d723b4
hex1bca78a07175

30556421124469 has 2 divisors, whose sum is σ = 30556421124470. Its totient is φ = 30556421124468.

The previous prime is 30556421124413. The next prime is 30556421124517. The reversal of 30556421124469 is 96442112465503.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 30295006728100 + 261414396369 = 5504090^2 + 511287^2 .

It is a cyclic number.

It is not a de Polignac number, because 30556421124469 - 221 = 30556419027317 is a prime.

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

It is a congruent number.

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

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

Almost surely, 230556421124469 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 30556421124469 in words is "thirty trillion, five hundred fifty-six billion, four hundred twenty-one million, one hundred twenty-four thousand, four hundred sixty-nine".