Search a number
-
+
30609151033 is a prime number
BaseRepresentation
bin11100100000011100…
…101001010000111001
32221000012111222111111
4130200130221100321
51000141420313113
622021152200321
72132344330246
oct344034512071
987005458444
1030609151033
1111a8808223a
125b22b390a1
132b6a645cb6
1416a52d45cd
15be235313d
hex720729439

30609151033 has 2 divisors, whose sum is σ = 30609151034. Its totient is φ = 30609151032.

The previous prime is 30609151009. The next prime is 30609151093. The reversal of 30609151033 is 33015190603.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 30050915904 + 558235129 = 173352^2 + 23627^2 .

It is a cyclic number.

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

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

It is a junction number, because it is equal to n+sod(n) for n = 30609150986 and 30609151004.

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

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

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

Almost surely, 230609151033 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7290, while the sum is 31.

The spelling of 30609151033 in words is "thirty billion, six hundred nine million, one hundred fifty-one thousand, thirty-three".