Search a number
-
+
305125452641 is a prime number
BaseRepresentation
bin1000111000010101110…
…01001110101101100001
31002011120201100222222102
410130022321032231201
514444344103441031
6352101145220145
731021202361062
oct4341271165541
91064521328872
10305125452641
111084483aa779
124b175a91655
1322a08973219
1410aa7b3c569
157e0c6467cb
hex470ae4eb61

305125452641 has 2 divisors, whose sum is σ = 305125452642. Its totient is φ = 305125452640.

The previous prime is 305125452559. The next prime is 305125452679. The reversal of 305125452641 is 146254521503.

It is an a-pointer prime, because the next prime (305125452679) can be obtained adding 305125452641 to its sum of digits (38).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 300769980625 + 4355472016 = 548425^2 + 65996^2 .

It is a cyclic number.

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

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

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2305125452641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 144000, while the sum is 38.

The spelling of 305125452641 in words is "three hundred five billion, one hundred twenty-five million, four hundred fifty-two thousand, six hundred forty-one".