Search a number
-
+
30665641507049 is a prime number
BaseRepresentation
bin1101111100011111001101…
…01010110011100011101001
311000120121101021121212112002
412332033212222303203221
513004411213211211144
6145115333510500345
76313343120011313
oct676174652634351
9130517337555462
1030665641507049
1198532531a742a
1235332593646b5
1314159b0554893
147803214547b3
15382a3c7bc14e
hex1be3e6ab38e9

30665641507049 has 2 divisors, whose sum is σ = 30665641507050. Its totient is φ = 30665641507048.

The previous prime is 30665641506959. The next prime is 30665641507093. The reversal of 30665641507049 is 94070514656603.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 19724861447824 + 10940780059225 = 4441268^2 + 3307685^2 .

It is a cyclic number.

It is not a de Polignac number, because 30665641507049 - 28 = 30665641506793 is a prime.

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

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

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

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

Almost surely, 230665641507049 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 16329600, while the sum is 56.

The spelling of 30665641507049 in words is "thirty trillion, six hundred sixty-five billion, six hundred forty-one million, five hundred seven thousand, forty-nine".