Search a number
-
+
30150290301193 is a prime number
BaseRepresentation
bin1101101101011111010010…
…10101111110000100001001
310221202100011120102002201201
412312233221111332010021
512422440243304114233
6144042504021544201
76231200205023506
oct666575125760411
9127670146362651
1030150290301193
119674736949847
12346b3b3275061
1313a9210ba1a5a
147633d35084ad
153744290ed77d
hex1b6be957e109

30150290301193 has 2 divisors, whose sum is σ = 30150290301194. Its totient is φ = 30150290301192.

The previous prime is 30150290301167. The next prime is 30150290301203. The reversal of 30150290301193 is 39110309205103.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 30150290301184 + 9 = 5490928^2 + 3^2 .

It is an emirp because it is prime and its reverse (39110309205103) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 30150290301193 - 29 = 30150290300681 is a prime.

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

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

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

Almost surely, 230150290301193 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 21870, while the sum is 37.

Adding to 30150290301193 its reverse (39110309205103), we get a palindrome (69260599506296).

The spelling of 30150290301193 in words is "thirty trillion, one hundred fifty billion, two hundred ninety million, three hundred one thousand, one hundred ninety-three".