Search a number
-
+
30320003220613 is a prime number
BaseRepresentation
bin1101110010011011011010…
…00001011000010010000101
310222100120020011012200022221
412321031231001120102011
512433230331311024423
6144252452302452341
76246355642031161
oct671155501302205
9128316204180287
1030320003220613
11972a706417037
1234982778940b1
1313bc219502672
1476b6d2db1ca1
15378a5d63ce5d
hex1b936d058485

30320003220613 has 2 divisors, whose sum is σ = 30320003220614. Its totient is φ = 30320003220612.

The previous prime is 30320003220517. The next prime is 30320003220631. The reversal of 30320003220613 is 31602230002303.

Together with next prime (30320003220631) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 27482149644964 + 2837853575649 = 5242342^2 + 1684593^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

Almost surely, 230320003220613 is an apocalyptic number.

It is an amenable number.

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

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

30320003220613 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 3888, while the sum is 25.

Adding to 30320003220613 its reverse (31602230002303), we get a palindrome (61922233222916).

The spelling of 30320003220613 in words is "thirty trillion, three hundred twenty billion, three million, two hundred twenty thousand, six hundred thirteen".