Search a number
-
+
305336621669 is a prime number
BaseRepresentation
bin1000111000101110111…
…10110001101001100101
31002012010102201111102112
410130113132301221211
520000312133343134
6352134131250405
731026345314162
oct4342736615145
91065112644375
10305336621669
11108546621132
124b214749a05
1322a4063b201
1410ac7bcb069
157e20e5a1ce
hex47177b1a65

305336621669 has 2 divisors, whose sum is σ = 305336621670. Its totient is φ = 305336621668.

The previous prime is 305336621651. The next prime is 305336621683. The reversal of 305336621669 is 966126633503.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 229213052644 + 76123569025 = 478762^2 + 275905^2 .

It is a cyclic number.

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

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 2305336621669 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3149280, while the sum is 50.

The spelling of 305336621669 in words is "three hundred five billion, three hundred thirty-six million, six hundred twenty-one thousand, six hundred sixty-nine".